Cod sursa(job #2079741)
| Utilizator | Data | 1 decembrie 2017 19:27:30 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
const int NMAX = 1000000;
int n;
int v[NMAX];
int main() {
f >> n;
int candidat = 0;
int k = 0;
for (int i = 1; i <= n; i++) {
f >> v[i];
if (k == 0) candidat = v[i];
if (v[i] == candidat) k++;
else k--;
}
int aparitii = 0;
for (int i = 1; i <= n; i++)
if (v[i] == candidat) aparitii++;
if (aparitii >= n / 2 + 1) g << candidat << ' ' << aparitii;
else g << -1;
g << '\n';
return 0;
}