Pagini recente » Cod sursa (job #217265) | Cod sursa (job #2264971) | Cod sursa (job #2948697) | Cod sursa (job #51592) | Cod sursa (job #692507)
Cod sursa(job #692507)
#include <fstream>
using namespace std;
#define N 1000010
int n;
int v[N];
inline void solve() {
int who = 0, cnt = 0;
ifstream fin("elmaj.in");
fin >> n;
for (int i = 0; i < n; ++i) {
fin >> v[i];
if (cnt == 0) {
who = v[i];
++cnt;
continue;
}
if (v[i] == who) {
++cnt;
} else {
--cnt;
}
}
fin.close();
ofstream fout("elmaj.out");
if (cnt == 0) {
fout << "-1\n";
fout.close();
return;
}
cnt = 0;
for (int i = 0; i < n; ++i) {
if (v[i] == who) {
++cnt;
}
}
if (cnt > n / 2) {
fout << who << " " << cnt << "\n";
} else {
fout << "-1\n";
}
fout.close();
}
int main() {
solve();
return 0;
}