Pagini recente » Cod sursa (job #1455967) | Cod sursa (job #2489625) | Cod sursa (job #1612278) | Cod sursa (job #702898) | Cod sursa (job #1267863)
#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];
int numar_aparitii(int candidat) {
int nr = 0;
for (int i = 1; i <= n; i++)
if (candidat == v[i]) nr++;
return nr;
}
void elmaj() {
int candidat = 0, k = 0, nr;
for (int i = 1; i <= n; i++) {
f >> v[i];
if (k == 0) {
candidat = v[i];
k = 1;
}
else {
if (candidat == v[i]) k++;
else k--;
}
}
nr = numar_aparitii(candidat);
if (nr >= (n + 1) / 2) g << candidat << ' ' << nr;
else g << -1;
g << '\n';
}
int main() {
f >> n;
elmaj();
return 0;
}