Cod sursa(job #2340945)
| Utilizator | Data | 11 februarie 2019 12:26:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#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;
}
