Pagini recente » Cod sursa (job #768686) | Monitorul de evaluare | Borderou de evaluare (job #1559143) | Cod sursa (job #759793) | Cod sursa (job #2289552)
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int, int> m;
int N;
int main() {
ifstream iff("elmaj.in");
ofstream off("elmaj.out");
iff >> N;
int nr_ap = -1;
int elm_maj = -1;
for (int i = 0; i < N; ++i) {
int val;
iff >> val;
m[val]++;
if (m[val] >= N / 2 + 1 && m[val] >= nr_ap) {
nr_ap = m[val];
elm_maj = val;
}
}
if (nr_ap == -1) {
off << -1;
printf("-1");
} else {
off << elm_maj << " " << nr_ap;
}
return 0;
}