Pagini recente » Cod sursa (job #195500) | Cod sursa (job #983416) | Cod sursa (job #868889) | Cod sursa (job #2089791) | Cod sursa (job #2150535)
#include <fstream>
#include <unordered_map>
int main(void) {
int N, Element;
std::ifstream fin("elmaj.in");
fin >> N;
std::unordered_map<int, int> MapCount;
for (auto i = 0; i < N; i++) {
fin >> Element;
MapCount.try_emplace(Element, 0);
MapCount[Element] += 1;
}
std::ofstream fout("elmaj.out");
for (auto &entry : MapCount) {
if (entry.second >= N / 2 + 1) {
fout << entry.first << " " << entry.second;
exit(0);
}
}
fout << -1;
return 0;
}