Cod sursa(job #661339)
Utilizator | Data | 14 ianuarie 2012 12:36:38 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int maxe,n,i,k,x,a[1000000];
int main()
{
f>>n;
k=n/2;
for (i=1;i<=n;i++) {
f>>x;
if (x>maxe) maxe=x;
a[x]++;
}
for (i=0;i<=maxe;i++)
if (a[i]>k)
{
g<<i<<' '<<a[i];
return 0;
}
g<<'-1';
return 0;
}