Cod sursa(job #2340251)
| Utilizator | Data | 10 februarie 2019 10:06:25 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#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;
}
