Cod sursa(job #663078)
Utilizator | Data | 17 ianuarie 2012 19:46:11 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int maxim,n,x,i,t,a[1000005];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
t=n/2;
for (i=1;i<=n;i++) {
f>>x;
if (x>maxim) maxim=x;
a[x]++;
}
for (i=0;i<=maxim;i++)
if (a[i]>t)
{
g<<i<<' '<<a[i];
return 0;
}
g<<"-1";
f.close();
g.close();
return 0;
}