Pagini recente » Cod sursa (job #1092792) | Cod sursa (job #1077674) | Cod sursa (job #1154806)
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
map<int, int> m;
int n, ok, a[1000005];
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int t;
scanf("%d", &n);
for(int i=0; i<n; i++){
scanf("%d ", &t);
a[i] = t;
m[t]++;
}
/*for(int i=0; i<n; i++){
if(m[a[i]] >= n/2+1){
printf("%d %d\n", a[i], m[a[i]]);
ok=1;
break;
}
}*/
for(map<int, int>::iterator i=m.begin(); i!=m.end(); i++){
if(i->second >= n/2+1){
printf("%d %d\n", i->first, i->second);
ok = 1;
break;
}
}
if(!ok) printf("-1\n");
return 0;
}