Cod sursa(job #1373121)
Utilizator | Diana Ghinea diana97 | Data | 4 martie 2015 16:55:01 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
const int NMAX = 1000000 + 1;
int n;
int v[NMAX];
void rezolva() {
int cand = 0, k = 0, nr = 0;
for (int i = 1; i <= n; i++) {
f >> v[i];
if (k == 0) cand = v[i];
if (cand == v[i]) k++;
else k--;
}
for (int i = 1; i <= n; i++)
if (cand == v[i]) nr++;
if (nr >= n / 2 + 1) g << cand << ' ' << nr;
else g << -1;
g << '\n';
}
int main() {
f >> n;
rezolva();
return 0;
}