Cod sursa(job #1689374)
Utilizator | Data | 14 aprilie 2016 10:38:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, ap[1000005], el, m;
int main()
{
f>>n;
while(n--)
{
int x;
f>>x;
ap[x]++;
if(ap[x] > m)
{
m = ap[x];
el = x;
}
}
if(ap[el] <= n/2) g<<-1<<'\n';
else g<<el<<' '<<ap[el]<<'\n';
return 0;
}