Cod sursa(job #2163755)
| Utilizator | Data | 12 martie 2018 19:52:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <cstdio>
using namespace std;
int n, cand, k, nr, a[1000001];
int main ()
{
freopen("elmaj.in", "r", stdin);
freopen("elmaj.out", "w", stdout);
scanf("%d", &n);
for (int i=1; i<=n; i++)
scanf("%d", &a[i]);
cand=-1;
k=0;
for (int i=1; i<=n; i++){
if (k==0){
cand=a[i];
k=1;
}
else if (a[i]==cand) k++;
else k--;
}
if (cand<0) printf("-1");
else{
nr=0;
for (int i=1; i<=n; i++)
if (a[i]==cand) nr++;
if (nr>n/2) printf("%d %d", cand, nr);
else printf("-1");
}
return 0;
}
