Pagini recente » Cod sursa (job #301566) | fmi-no-stress-9/solutii | Cod sursa (job #2054772) | Cod sursa (job #2743705) | Cod sursa (job #1755170)
#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&&x==maxv){
a[maxv]++;
}else{
a[x]++;
if(a[x]>a[maxv]){maxv=x;}
}
}
if(a[maxv]>n/2)
printf("%d %d",maxv,a[maxv]);
else printf("-1");
}