codeforces--701A Cards

codeforces 701A

题解

枚举。

#include <iostream>
#include <algorithm>
using namespace std;

const int maxn = 100 + 10;
int a[maxn], vis[maxn];

int main(){

    int n, sum = 0;
    cin >> n;

    for(int i = 1; i <= n; ++i) cin >> a[i], sum += a[i];
    int subsum = 2 * sum / n;
    for(int i = 1; i <= n; ++i){
        if(vis[i]) continue;
        for(int j = 1; j <= n; ++j){
            if(!vis[j] && i != j && a[i] + a[j] == subsum){
                cout << i << " " << j << endl;
                vis[i] = vis[j] = 1;
                break;
            }
        }
    }

    return 0;
}