Pagini recente » Cod sursa (job #1118157) | Cod sursa (job #2848352) | Cod sursa (job #827892) | Cod sursa (job #2069358) | Cod sursa (job #663373)
Cod sursa(job #663373)
#include <fstream>
using namespace std;
int a[1000000],n,i,maxnr,maxim,poz,x;
int main ()
{
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
f >>n;
for (i=1; i<=n; i++)
{
f >>x;
a[x]++;
if (x>maxim) maxim=x;
}
/*
i=1; nr=1;
bool ok=false;
while (i<n)
{
if (a[i]==a[i+1]) nr++;
else
{
if (nr > n/2)
{
ok=true;
g << a[i] << ' '<<nr;
break;
}
nr=1;
}
i++;
}*/
maxnr=0; poz=0;
for (i=0; i<=maxim; i++)
if (a[i]>maxnr)
{
maxnr=a[i];
poz=i;
}
if (maxnr>=n/2) g <<i <<' '<<a[i];
else g << -1;
return 0;
}