Cod sursa(job #2222592)
| Utilizator | Data | 17 iulie 2018 13:54:15 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
map<int, int> contor;
int main()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
int n;
int maximum = 0;
scanf("%d", &n);
for(int i = 0; i < n; ++i)
{
int a;
scanf("%d", &a);
++contor[a];
if(contor[a] > contor[maximum])
maximum = a;
}
if(contor[maximum] >= n / 2 + 1)
printf("%d %d", maximum, contor[maximum]);
else
printf("-1");
return 0;
}