Cod sursa(job #2572878)
| Utilizator | Data | 5 martie 2020 14:44:02 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | OJI 2020 | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main() {
int n; fin >> n;
vector<int> v(n);
fin >> v[0];
int cand = v[0], frq = 1;
for (int i = 1; i < n; i++) {
fin >> v[i];
if (v[i] == cand)
frq++;
else if (--frq == 0) {
cand = v[i];
frq = 1;
}
}
frq = 0;
for (int i = 0; i < n; i++)
if (v[i] == cand)
frq++;
if (frq >= n / 2 + 1)
fout << cand << ' ' << frq << '\n';
else
fout << "-1\n";
fout.close();
return 0;
}
