Cod sursa(job #3279565)
Utilizator | Data | 23 februarie 2025 15:04:07 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
unordered_map<int, int> f;
int main()
{
int i;
fin>>n;
for (i=1;i<=n;i++)
{
long long x;
fin>>x;
f[x]++;
}
for (auto i:f)
{
if (i.second > n/2)
{
fout<<i.first<<" "<<i.second<<'\n';
return 0;
}
}
fout<<-1<<'\n';
return 0;
}