Cod sursa(job #1326271)
Utilizator | Data | 24 ianuarie 2015 23:57:29 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
long long v[1000005];
int main()
{ ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, a, i, maxap=-9999999999, maxel;
f>>n;
while (f>>a)
v[a]++;
for (i=1;i<=1000005;++i)
if (v[i]>maxap)
{ maxel=i;
maxap=v[i];
}
if (maxap>n/2)
g<<maxel<<' '<<maxap;
else g<<"-1";
return 0;
}