Cod sursa(job #2495803)
| Utilizator | Data | 19 noiembrie 2019 20:41:30 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fi("elmaj.in");
ofstream fo("elmaj.out");
int n;
int A[1000005];
int main()
{
fi >> n;
fi >> A[1];
int av = 1, nr = A[1];
for (int i = 2; i <= n; i++)
{
fi >> A[i];
if (A[i] == nr)
av++;
else
av--;
if (av <= 0)
nr = A[i], av = 1;
}
int cnt = 0;
for (int i = 1; i <= n; i++)
if (A[i] == nr)
cnt++;
if (cnt < n / 2 + 1)
fo << -1;
else
fo << nr << " " << cnt;
return 0;
}
