Pagini recente » Cod sursa (job #1976869) | Cod sursa (job #1582671) | Cod sursa (job #669852) | Cod sursa (job #1488192) | Cod sursa (job #1755157)
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
map<int,int> a;
int n,maxv,maxc=-1;
int main(){
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int e,x;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&x);
a[x]++;
if(a[x]>maxc){maxc=a[x];maxv=x;}
}
if(maxc>=n/2)
printf("%d %d",maxv,maxc);
else printf("-1");
}