Codeforces Round #364 (Div. 2) A. Cards

 

签到题

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;
#define N 6000
#define INF 1e9+5
int n, sum, mid;
int a[1000000];
int main()
{
	int i, j;
	scanf("%d", &n);
	sum = 0;
	for (i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
		sum += a[i];
	}
	mid = sum * 2 / n;
	for (i = 1; i <= n; i++)
	{
		if (a[i] == 0) continue;
		for (j = i + 1; j <= n; j++)
		{
			if (a[i] + a[j] == mid)
			{
				printf("%d %d\n", i, j);
				a[i] = 0;
				a[j] = 0;
			}
		}
	}
	return 0;
}