Cod sursa(job #2340951)
| Utilizator | Data | 11 februarie 2019 12:31:31 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
#include<unordered_map>
using namespace std;
long i, n, x, rez;
unordered_map <long, long> nr;
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++)
{
scanf("%ld",&x);
nr[x]++;
if (nr[x]*2+1>=n)
rez=x;
}
if (nr[rez]*2+1>=n)
printf("%ld %ld",rez,nr[rez]);
else
printf("-1");
return 0;
}
