Pagini recente » Borderou de evaluare (job #3092721) | Cod sursa (job #3358740) | Borderou de evaluare (job #3092692) | Monitorul de evaluare | Cod sursa (job #3315545)
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
long long cand = 0; int cnt = 0;
for (int i = 0; i < n; ++i) {
if (cnt == 0) cand = v[i], cnt = 1;
else if (v[i] == cand) ++cnt;
else --cnt;
}
cnt = 0;
for (int i = 0; i < n; ++i)
if (v[i] == cand)
++cnt;
if (cnt >= n / 2 + 1)
cout << cand << " " << cnt;
else cout << -1;
return 0;
}