Cod sursa(job #1324860)
Utilizator | Data | 22 ianuarie 2015 21:02:24 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int v[100000000],fr[100000000];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,x,i,j,cont=1,ok=0,aux,maxx;
f>>n;
for(i=0;i<n;++i)
{
f>>v[i];
fr[v[i]]++;
}
for(i=0;i<10000000;++i)
if(fr[v[i]]>=(n/2+1))
{g<<v[i]<<' '<<fr[v[i]];ok=1;break;}
if(!ok)
g<<'-1';
return 0;
}