Pagini recente » Istoria paginii runda/ath3/clasament | Cod sursa (job #231579) | Istoria paginii runda/fdsfdsfds/clasament | Cod sursa (job #289518) | Cod sursa (job #1998156)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e6 + 5;
int N;
int v[NMax];
int main() {
in>>N;
int nr=0,cand=0;
for (int i=1;i <= N;++i) {
in>>v[i];
if (!nr) {
cand = v[i];
}
else if (cand == v[i]) {
++nr;
}
else {
--nr;
}
}
nr = 0;
for (int i=1;i <= N;++i) {
if (cand == v[i]) {
++nr;
}
}
if (nr > N/2) {
out<<cand<<' '<<nr<<'\n';
}
else {
out<<"-1\n";
}
in.close();out.close();
return 0;
}