Pagini recente » Cod sursa (job #1767026) | Cod sursa (job #2287979) | Cod sursa (job #2427864) | Cod sursa (job #1991172) | Cod sursa (job #1755128)
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> a;
int b[1000002],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);
e=find(a.begin(),a.end(),x) - a.begin();
if(e==i-1){
a.push_back(x);
if(maxc<0){maxc=1,maxv=x;}
}else{
b[e]++;
if(b[e]>maxc){
maxc=b[e];
maxv=x;
}
}
}
if(maxc>n/2)
printf("%d %d",maxv,maxc);
else printf("-1");
}