Pagini recente » miculstring | Diferente pentru template/algoritmiada-2009/header intre reviziile 16 si 25 | Cod sursa (job #1529764) | Cod sursa (job #1569570) | Cod sursa (job #1755177)
#include<iostream>
#include<unordered_map>
using namespace std;
unordered_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[x]>a[maxv]){maxv=x;}
}
if(a[maxv]>n/2)
printf("%d %d",maxv,a[maxv]);
else printf("-1");
}