Pagini recente » Cod sursa (job #2387555) | Cod sursa (job #2612571) | Cod sursa (job #517399) | Cod sursa (job #2645998) | Cod sursa (job #2340251)
#include <cstdio>
#include <unordered_map>
using namespace std;
unordered_map <int, int> fr;
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
if(fr.find(x) == fr.end())
fr[x] = 1;
else fr[x]++;
}
for(auto it : fr){
if(it.second > n / 2){
printf("%d %d\n", it.first, it.second);
return 0;
}
}
printf("%d\n", -1);
return 0;
}