Cod sursa(job #1881816)
| Utilizator | Data | 16 februarie 2017 19:08:42 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <cstdio>
using namespace std;
int v[1000000];
int main()
{
int n, i;
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &n);
for(i = 0; i < n; i++)
scanf("%d", &v[i]);
int el = 0, ap = 0;
for(i = 0; i < n; i++)
{
if(ap == 0)
{
el = v[i];
ap = 1;
}
else if(v[i] == el)
ap++;
else ap--;
}
ap = 0;
for(i = 0; i < n; i++)
{
if(el == v[i]) ap++;
}
if(ap >= n / 2 + 1)
printf("%d %d", el, ap);
else printf("-1");
return 0;
}
