Codeforces #364（Div.2）A.Card

Input

The first line of the input contains integer n (2 ≤ n ≤ 100) — the number of cards in the deck. It is guaranteed that n is even.

The second line contains the sequence of n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is equal to the number written on the i-th card.

Output

Print n / 2 pairs of integers, the i-th pair denote the cards that should be given to the i-th player. Each card should be given to exactly one player. Cards are numbered in the order they appear in the input.

It is guaranteed that solution exists. If there are several correct answers, you are allowed to print any of them.

Examples

Input
6
1 5 7 4 4 3
Output
1 3
6 2
4 5
Input
4
10 10 10 10
Output
1 2
3 4

Note

In the first sample, cards are distributed in such a way that each player has the sum of numbers written on his cards equal to 8.

In the second sample, all values ai are equal. Thus, any distribution is acceptable.

 

题目大意：
给出n个人，每个人的卡片数目，两个人分成一组，使得每一组的卡片数目和都相等。

思路：

1、贪心的将卡片数排序，从小到大，因为保证有解，那么最少卡片的将和最多卡片的组队，第二少卡片的将和第二多卡片的组队，依次类推。

Ac代码：

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int val,pos;
}a[10000];
int cmp(node a,node b)
{
    return a.val<b.val;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i].val);
            a[i].pos=i+1;
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n/2;i++)
        {
            printf("%d %d\n",a[i].pos,a[n-i-1].pos);
        }
    }
}