Cod sursa(job #1408169)
Utilizator | Data | 29 martie 2015 21:14:32 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
using namespace std;
int maxi, sol, i, n, a, v[1000005];
int main()
{
freopen ("elmaj.in", "r", stdin);
freopen ("elmaj.out", "w", stdout);
scanf ("%d", &n);
for (i=1; i<=n; i++)
{
scanf ("%d", &a);
v[a]++;
if (v[a]>v[sol]) sol=a;
}
if (v[sol]>=n/2+1) printf ("%d %d", sol, v[sol]);
else printf ("-1");
}