Pagini recente » Cod sursa (job #3280181) | Cod sursa (job #1433920) | Cod sursa (job #1273359) | Cod sursa (job #2755851) | Cod sursa (job #2489760)
using namespace std;
#include<iostream>
#include<fstream>
#include<algorithm>
int n;
long long a[100001];
int main() {
ifstream fin("elmaj.in");
ofstream fout ("elmaj.out");
fin >> n;
for (int i = 1; i<=n; i++) {
fin >> a[i];
}
int cand = -1, k = 0;
for (int i = 1; i<=n; i++) {
if (k == 0) {
cand = a[i];
k = 1;
} else {
if (a[i] == cand) {
k++;
} else {
k--;
}
}
}
if (cand < 0) {
fout << cand;
return 0;
}
int nr = 0;
for (int i = 1; i<=n; i++) {
if (a[i] == cand) {
nr++;
}
}
if (nr > n/2) {
fout << cand << " " << nr;
} else {
fout << "-1";
}
return 0;
}