Pagini recente » Cod sursa (job #2406793) | Cod sursa (job #1604149) | Cod sursa (job #2063425) | Borderou de evaluare (job #1759968) | Cod sursa (job #3152900)
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, a[1000005], cand, f;
int main()
{
in >> n;
for (int i = 1; i <= n; i++) {
in >> a[i];
}
cand = a[1];
f = 1;
for (int i = 2; i <= n; i++) {
if (a[i] == cand) {
f++;
}
else {
f--;
if (f == 0) {
cand = a[i];
f = 1;
}
}
}
f = 0;
for (int i = 1; i <= n; i++)
if (a[i] == cand)
f++;
if (f >= n / 2 + 1)
out << cand << " " << f << '\n';
else
out << -1 << '\n';
return 0;
}