结构体一级排序:(CF733A)
#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 105
struct Node{
int c;
int v;
};
Node num[maxn];
int cmp(const void* a,const void* b)
{
Node *x = (Node*)a;
Node *y = (Node*)b;
return x->v - y->v;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&num[i].v);
num[i].c = i+1;
}
qsort(num,n,sizeof(num[0]),cmp);
for(int i=0;i<n/2;i++)
{
printf("%d %d\n",num[i].c,num[n-1-i].c);
}
return 0;
}
未完待续