Pagini recente » Cod sursa (job #280282) | Cod sursa (job #107004) | Cod sursa (job #2315763) | Cod sursa (job #544371) | Cod sursa (job #1478694)
# include <fstream>
# include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000001],n,i,nr,maxim,e;
int main () {
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
nr=1;
maxim=1;
for(i=2;i<=n;i++){
if(v[i]==v[i-1])
nr++;
else
nr=1;
if(nr>maxim){
maxim=nr;
e=v[i];
}
}
if(maxim>=n/2+1)
fout<<e<<" "<<maxim;
else
fout<<-1;
return 0;
}