Pagini recente » Cod sursa (job #1104484) | Cod sursa (job #3237168) | Cod sursa (job #106845) | Cod sursa (job #933864) | Cod sursa (job #906614)
Cod sursa(job #906614)
#include <iostream>
#include <fstream>
using namespace std;
int v[1000001],ap[1000001],b[1000001];
int main()
{ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,poz,m=0,maxim,elem;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{poz=1;
while(poz<=m&&v[i]!=b[poz])
poz++;
if(poz==m+1)
{b[++m]=v[i];
ap[m]=1;
}
else
ap[poz]++;
}
for(i=1,maxim=0;i<=m;i++)
if(ap[i]>maxim)
{maxim=ap[i];
elem=b[i];
}
if(maxim>=n/2+1)
fout<<elem<<" "<<maxim;
else
fout<<"-1";
return 0;
}