Pagini recente » Cod sursa (job #2073223) | Cod sursa (job #851933) | Cod sursa (job #534564) | Cod sursa (job #1633757) | Cod sursa (job #703695)
Cod sursa(job #703695)
#include <iostream>
#include <fstream>
#include <time.h>
#include <algorithm>
using namespace std;
int v[1000069];
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,i,elmaj,nmax,elnou,nrnou;
in>>n;
for (i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
elmaj=v[1];
nmax=1;
elnou=v[1];
nrnou=1;
for (i=2;i<=n;i++)
{
if (nmax<nrnou)
{
nmax=nrnou;
elmaj=elnou;
}
if (elnou==v[i])
nrnou++;
else
{
if (nmax<nrnou)
{
nmax=nrnou;
elmaj=elnou;
}
elnou=v[i];
nrnou=1;
}
}
if (nmax>=n/2+1)
out<<elmaj<<" "<<nmax;
else
out<<-1;
cout<<(double)clock()/CLOCKS_PER_SEC;
return 0;
}