Cod sursa(job #634913)
Utilizator | Data | 17 noiembrie 2011 22:12:17 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long v[32000],i,n,k[32000],elmaj,nr;
int main()
{
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
for(i=1;i<=n; i++)
k[v[i]]=k[v[i]]+1;
for(i=1; i<n; i++)
{
if(k[i]>k[i+1]&&nr<k[i]) {elmaj=i;nr=k[i];}
}
out<<elmaj<<' '<<nr;
return 0;
}