Pagini recente » Istoria paginii utilizator/tudi1342 | Profil Eduard_Mihai | Istoria paginii utilizator/andreicioata | Istoria paginii utilizator/alexa13 | Cod sursa (job #2079745)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
const int NMAX = 1000000;
int n;
int v[NMAX + 1];
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) g << candidat << ' ' << aparitii;
else g << -1;
g << '\n';
return 0;
}