Cod sursa(job #1959652)
Utilizator | Data | 9 aprilie 2017 19:17:35 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, v[500004];
int main(){
fin>>n;
int maxim=0;
for(int i=1; i<=n; ++i){
long long x;
fin>>x;
++v[x]; if(v[x]>maxim) maxim = v[x];
}
if(maxim >= n/2 + 1) fout<<maxim;
else fout<<-1;
return 0;
}