代码仅供参考,勿拷贝作为课堂派作业!!!
map容器详解:http://blog.csdn.net/kavu1/article/details/52744677
#include<map>
#include<stdio.h>
#include<iostream>
#define ll long long
using namespace std;
int main()
{
ll t,n;
int i;
ll num,temp;
ll max;
map<ll,ll>m;
scanf("%I64d",&t);
while(t--)
{
max=0;
scanf("%I64d",&n);
for(i=0;i<n;i++)
{
scanf("%I64d",&num);
m[num]++;
}
map<ll,ll>::iterator iter;
for(iter=m.begin();iter!=m.end();iter++)
{
if(iter->second>max)
{
temp=iter->first;
max=iter->second;
}
}
printf("%I64d %I64d\n",temp,max);
}
return 0;
}