Cod sursa(job #3152900)
Utilizator | Dinuta Eduard Stefan TeddyDinuta | Data | 27 septembrie 2023 02:03:19 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n, a[1000005], cand, f;
int main()
{
in >> n;
for (int i = 1; i <= n; i++) {
in >> a[i];
}
cand = a[1];
f = 1;
for (int i = 2; i <= n; i++) {
if (a[i] == cand) {
f++;
}
else {
f--;
if (f == 0) {
cand = a[i];
f = 1;
}
}
}
f = 0;
for (int i = 1; i <= n; i++)
if (a[i] == cand)
f++;
if (f >= n / 2 + 1)
out << cand << " " << f << '\n';
else
out << -1 << '\n';
return 0;
}