Pagini recente » Cod sursa (job #2810414) | Cod sursa (job #678879) | Cod sursa (job #1041531) | Cod sursa (job #1069879) | Cod sursa (job #2002653)
#include <fstream>
#include <iostream>
#include <unordered_map>
using namespace std;
unordered_map<int,int> freq;
int main ()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, nr;
f >> n;
for(int i = 0; i < n; ++i){
f >> nr;
freq[nr]++;
}
for(auto it = freq.begin(); it != freq.end(); ++it){
if(it->second >= (n/2)+1){
g << it->first << ' ' << it->second;
return 0;
}
}
g << "-1";
return 0;
}