Pagini recente » Cod sursa (job #2697987) | Cod sursa (job #1548925) | Cod sursa (job #2268902) | Cod sursa (job #702353) | Cod sursa (job #1373121)
#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;
}