Cod sursa(job #3282365)
Utilizator | Data | 5 martie 2025 12:59:25 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int n;
unordered_map<int, int> mt;
int main() {
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
cin >> n;
for (int i = 1; i <= n; ++i) {
int elem;
cin >> elem;
++mt[elem];
}
for (auto i : mt) {
if (i.second >= n / 2 + 1) {
cout << i.first << " " << i.second;
break;
}
}
}