Cod sursa(job #662328)
| Utilizator | Data | 16 ianuarie 2012 15:40:32 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long int n,v[1000005],i,t,k,u,m;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
t=v[1];k=1;m=0;u=0;
for(i=2;i<=n;i++)
{
if(v[i]==t)
k++;
else
{
if(k>m)
{
m=k;
u=t;
}
t=v[i];
k=1;
}
}
if(k>m)
{
m=k;
u=t;
}
if(m>=n/2+1)
g<<u<<" "<<m;
else
g<<"-1";
return 0;
}