Cod sursa(job #2442119)
Utilizator | scarlat marius marius004 | Data | 22 iulie 2019 19:50:43 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
std::ifstream f("elmaj.in");
std::ofstream g("elmaj.out");
const int NMAX = 1'000'005;
int n,v[NMAX],cnt,look;
int main(){
f >> n;
for(int i = 0;i < n;i++){
f >> v[i];
if(!cnt){
look = v[i];
cnt = 1;
}else if(look == v[i])
cnt++;
else cnt--;
}
if(cnt < 0){
g << -1;
}else{
cnt = 0;
for(int i = 0;i < n;i++)
if(v[i] == look)
cnt++;
if(cnt > n / 2)
g << look << ' ' << cnt;
else g << -1;
}
f.close();
g.close();
return 0;
}