Pagini recente » Istoria paginii runda/dan_barbilian_2011 | Cod sursa (job #1717439) | Cod sursa (job #1760673) | Cod sursa (job #644491) | Cod sursa (job #3281889)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,aux ;
int main()
{
f>>n;
int vf[n+3]; for(i=0; i<n+3; i++) vf[i]=0;
for(i=1; i<=n; i++){
f>>aux;
vf[aux]++;
}
int aparmax=0, nrmax=0;
for(i=1; i<=n; i++){
if(vf[i]>aparmax) aparmax=vf[i],nrmax=i;
}
if(aparmax>=n/2+1) g<<nrmax<<" "<<aparmax;
else g<<-1;
return 0;
}