Pagini recente » Cod sursa (job #910337) | Istoria paginii runda/gym1_emag_mediu_2016/clasament | Cod sursa (job #2004768) | Cod sursa (job #3202893) | Cod sursa (job #2340945)
#include <stdio.h>
#include <unordered_map>
using namespace std;
int n, x, xrez;
unordered_map<int, int> fr;
int main()
{
xrez=-1;
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&x);
if (fr.find(x) == fr.end()) {
fr[x]=1;
} else {
fr[x]++;
if (fr[x]>n/2){
xrez=x;
}
}
}
if (xrez!=-1)
printf("%d %d\n", xrez, fr[xrez]);
else
printf("-1\n");
return 0;
}