Cod sursa(job #3171649)
| Utilizator | Data | 19 noiembrie 2023 11:58:20 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("becuri.in");
ofstream out("becuri.out");
int n, v[1000010], i, cand, k;
int main()
{
in >> n;
for (i = 1; i <= n; i++)
in >> v[i];
for (i = 1; i <= n; i++)
{
if (k == 0)
{
cand = v[i];
k++;
}
else if (cand == v[i])
{
k++;
}
else
k--;
}
k = 0;
for (i = 1; i <= n; i++)
{
if (v[i] == cand)
k++;
}
if (k >= n/2+1)
out << cand << ' ' << k;
else
out << -1;
return 0;
}
