Pagini recente » Cod sursa (job #2346684) | Cod sursa (job #1536995) | Monitorul de evaluare | Cod sursa (job #1100289) | Cod sursa (job #1755173)
#include<iostream>
#include<map>
using namespace std;
map<int,int> a;
int n,maxv,x;
int main(){
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x);
if(a[maxv]<n/2){
a[x]++;
if(a[x]>a[maxv]){maxv=x;}
}else if(x==maxv){
a[x]++;
}
}
if(a[maxv]>n/2)
printf("%d %d",maxv,a[maxv]);
else printf("-1");
}