Cod sursa(job #2955268)
Utilizator | Data | 16 decembrie 2022 17:53:21 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | cnsh_16_12 | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("elemaj.in");
ofstream cout("elemaj.out");
int x, n, freq[100001], maxx, nmax, nr;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> x;
if(x > nmax)
nmax = x;
freq[x]++;
}
for(int i = 1; i <= nmax; i++)
{
if(freq[i] > maxx)
maxx = i, nr = freq[i];
}
cout << maxx << " " << nr;
return 0;
}