Cod sursa(job #2740943)
Utilizator | Data | 14 aprilie 2021 20:28:34 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
map<int, int> m;
int main()
{
int i, x;
fin >> n;
for(i=1; i<=n; i++)
{
fin >> x;
m[x]++;
}
bool gasit=false;
for(auto p : m)
if(p.second>=n/2+1)
{
fout << p.first << ' ' << p.second;
gasit=true;
break;
}
if(!gasit)
fout << -1;
return 0;
}