Cod sursa(job #3176980)
| Utilizator | Data | 28 noiembrie 2023 10:23:50 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
unordered_map<int, int> fr;
int n;
int main()
{
int maxi, p, i, x;
fin >> n;
maxi = p = 0;
for(i=1; i<=n; i++)
{
fin >> x;
fr[x]++;
if(fr[x] > maxi)
{
maxi = fr[x];
p = x;
}
}
if(maxi < n / 2 + 1) fout << "-1";
else fout << p << " " << maxi;
fin.close();
fout.close();
return 0;
}
