Pagini recente » Cod sursa (job #2686109) | Cod sursa (job #1684213) | Cod sursa (job #2961217) | Cod sursa (job #1555760) | Cod sursa (job #1585711)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
// 1 2 3 3 2 2 2
// 2 2 2 2 1 1 1 34 1 2 3
const int MAXN = 1000100;
int n;
int v[MAXN];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
int cand = -1, ap = 0;
for (int i = 1; i <= n; ++i) {
if (v[i] != cand) {
ap--;
if (ap < 0) {
cand = v[i];
ap = 0;
}
}
else {
ap++;
}
}
ap = 0;
for (int i = 1; i <= n; ++i)
if (v[i] == cand)
++ap;
if (ap > n / 2)
fout << cand << " " << ap << "\n";
else
fout << -1;
return 0;
}