Pagini recente » Cod sursa (job #3269031) | Cod sursa (job #3278372) | Cod sursa (job #3253354) | Cod sursa (job #3284175) | Cod sursa (job #1379328)
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
const int kNMax = 1000010;
int n, v[kNMax];
int main() {
int cand, contor;
in >> n;
in >> v[1];
cand = v[1];
contor = 1;
for (int i = 2; i <= n; ++i) {
in >> v[i];
if (v[i] == cand)
++contor;
else {
if (!contor) {
contor = 1;
cand = v[i];
} else
--contor;
}
}
contor = 0;
for (int i = 1; i <= n; ++i)
if (cand == v[i])
++contor;
if (contor >= (n / 2) + 1)
out << cand << ' ' << contor << '\n';
else
out << -1 << '\n';
in.close();
out.close();
return 0;
}