ZOJ 3202 Second-price Auction(排序)

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;

typedef struct aaa
{

int p,id;
}aaa;

int com(aaa x,aaa y)
{

return x.p<y.p;
}
aaa a[120];
int main()
{
int T;
cin>>T;
while(T--)
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{

scanf("%d",&a[i].p);
a[i].id=i;
}
sort(a,a+n,com);
printf("%d %d\n",a[n-1].id+1,a[n-2].p);

}
return 0;
}