Cod sursa(job #639575)
| Utilizator | Data | 23 noiembrie 2011 16:35:17 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
# include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, ok, aux;
int a[1000005], ct[1000005];
int main()
{int i;
f>>n;
for (i = 1; i <= n; i++)
{
f>>a[i];
ct[a[i]]++;
}
aux = n / 2 + 1;
for (i = 1; i <= n; i++)
if (ct[a[i]] >= aux)
{
g<<a[i]<<" "<<ct[a[i]];
ct[a[i]] = -10;
ok = 1;
}
if (ok == 0) g<<-1;
return 0;
}
