Cod sursa(job #2306826)
| Utilizator | Data | 23 decembrie 2018 00:00:49 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000005];
int main()
{
int n, e = 0, nr = 0;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
if (v[i] == e)
nr++;
else
nr--;
if (nr == -1)
{
e = v[i];
nr = 1;
}
}
int k = 0;
for (int i = 1; i <= n; i++)
if (v[i] == e)
k++;
if (k < n / 2 + 1)
fout << -1 << '\n';
else
fout << e << ' ' << k << '\n';
return 0;
}
