Cod sursa(job #3177508)
Utilizator | Data | 29 noiembrie 2023 11:54:33 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.44 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n, minim = 0, val, cnt;
map <int, int> fr;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
int cnt = ++fr[x];
if (minim < cnt) {
minim = cnt;
val = x;
}
}
cout << val << " " << minim;
return 0;
}