Pagini recente » Cod sursa (job #2259939) | Cod sursa (job #2972283) | Cod sursa (job #3208074) | Cod sursa (job #3220124) | Cod sursa (job #1203319)
#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 elmaj () {
int k = 0, cand = -1;
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 nr = 0;
for (int i = 1; i <= n; i++)
if (v[i] == cand) nr++;
if (nr >= (n + 1) / 2) g << cand << ' ' << nr;
else g << -1;
g << '\n';
}
int main () {
f >> n;
elmaj();
return 0;
}