Cod sursa(job #1993535)
Utilizator | Seritan Luca LucaSeri | Data | 23 iunie 2017 11:18:03 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000000];
int main()
{
int n;
f >>n;
int prob, cnt = 1;
f >> v[0];
prob = v[0];
for(int i = 1; i < n; i++){
f >> v[i];
if(v[i] == prob) cnt ++;
else {
cnt --;
if(cnt == 0){
prob = v[i];
cnt ++;
}
}
}
cnt = 0;
for(int i = 0; i < n; i++){
if(v[i] == prob) cnt ++;
}
if(cnt > n/2) g << prob << " " << cnt;
else g << -1;
return 0;
}