Cod sursa(job #2691898)
| Utilizator | Data | 30 decembrie 2020 16:53:32 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
set <int> s;
multiset <int> ms;
int x, n;
int mxc = 0, mxn;
int main() {
int c;
f >> n;
for (int i = 1; i <= n; i++) {
f >> x;
s.insert(x);
ms.insert(x);
}
for (auto i = s.begin(); i != s.end(); i++) {
c = ms.count(*i);
if (c > mxc){
mxc = c;
mxn = *i;
}
}
if (mxc > n/2) {
g << mxn << " " << mxc;
} else {
g << -1;
}
return 0;
}
