Pagini recente » Cod sursa (job #989061) | Cod sursa (job #1130939) | Cod sursa (job #1317706) | Cod sursa (job #1438106) | Cod sursa (job #2819921)
#include <iostream>
#include <unordered_map>
#define MAXN 1000003
using namespace std;
unordered_map<int, int> m;
int N, v[MAXN];
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &N);
int m = 0, cnt = 0;
for(int i = 1; i <= N; i++) {
scanf("%d", &v[i]);
if(cnt == 0) {
m = v[i];
cnt = 1;
} else if (m == v[i]) {
cnt++;
} else {
cnt--;
}
}
cnt = 0;
for(int i = 1; i <= N; i++) {
if(v[i] == m) {
cnt++;
}
}
if(cnt >= N / 2 + 1)
cout << m << " " << cnt;
else
cout << -1;
}