CodeForces 686 B

这道题被它输出示例坑了许久

实际就是输出交换位置，完成排列。

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
int main() {
    int n;
    LL num[105];
    cin>>n;
    for (int i=1; i<=n; i++) {
        cin>>num[i];
    }
    for (int i=n; i>=1; i--) {
        for (int j=1; j<i; j++) {
            if (num[j]>num[j+1]) {
                swap (num[j],num[j+1]);
                cout<<j<<" "<<j+1<<endl;
            }
        }
    }
    return 0;
}