Pagini recente » Clasamentul arhivei de probleme | Cod sursa (job #2120105) | Cod sursa (job #915763) | Cod sursa (job #915756) | Cod sursa (job #2667274)
#include <iostream>
#include <fstream>
const int NMAX = 1e6;
int a[1 + NMAX];
int main() {
std::ifstream in("elmaj.in");
std::ofstream out("elmaj.out");
int n;
int val = -1, cnt = 1;
in >> n;
for (int i = 1; i <= n; ++i) {
in >> a[i];
if (a[i] != val) {
--cnt;
if (cnt == 0)
val = a[i], cnt = 1;
}
else
++cnt;
}
cnt = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] == val)
++cnt;
}
if (cnt >= n / 2 + 1)
out << val << ' ' << cnt;
else
out << -1;
return 0;
}