Pagini recente » Cod sursa (job #2524845) | Istoria paginii runda/runda_ezoterica_4.5 | preoji/clasament/9 | Cod sursa (job #2922153) | Cod sursa (job #1243804)
#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 = -1, k = 0;
for (int i = 1; i <= n; i++) {
f >> v[i];
if (k == 0) cand = v[i], k++;
else if (v[i] == cand) k++;
else k--;
}
int aparitii = 0;
for (int i = 1; i <= n; i++) {
if (v[i] == cand) aparitii++;
}
if (aparitii >= (n + 1) / 2) g << cand << ' ' << aparitii;
else g << -1;
g << '\n';
}
int main() {
f >> n;
rezolva();
return 0;
}