Cod sursa(job #1710537)
Utilizator | Data | 29 mai 2016 11:20:21 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, M=0, c[1000001]={}, x, p;
int main(){
f >> n;
for( int i=1; i <= n; i++ ){
f >> x;
c[x]++;
if( c[x] > M ){
M = c[x];
p = x;
}
}
if( M >= (n+1)/2 )
g << p <<' '<< M;
else g << -1;
return 0;
}