Cod sursa(job #2381361)
| Utilizator | Data | 16 martie 2019 17:05:26 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int V[100005], n;
int main() {
in >> n;
for(int i=1; i<=n; i++)
in >> V[i];
int index = 0, candidat = 0, ap = 0;
for(int i=1; i<=n; i++) {
if(index == 0) {
candidat = V[i];
index = 1;
}
else {
if(V[i] == candidat)
index++;
else
index--;
}
}
for(int i=1; i<=n; i++) {
if(V[i] == candidat)
ap++;
}
if(ap < n/2 +1)
out << -1;
else
out << candidat << " " << ap;
return 0;
}