Pagini recente » Cod sursa (job #1995374) | Cod sursa (job #2810420) | Cod sursa (job #1930480) | Cod sursa (job #2273330) | Cod sursa (job #2340255)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unordered_map <int, int> fr;
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i){
int x;
fin >> x;
if(fr.find(x) == fr.end())
fr[x] = 1;
else fr[x]++;
}
for(auto it : fr){
if(it.second > n / 2){
fout << it.first << ' ' << it.second << '\n';
return 0;
}
}
fout << -1 << '\n';
return 0;
}