Cod sursa(job #2785069)
Utilizator | Data | 17 octombrie 2021 22:05:58 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n, x;
map <int, int> mp;
int main()
{
cin>>n;
while(cin>>x)
mp[x]++;
int nr = -1;
for(auto it : mp)
if(it.second >= (n/2) + 1 && it.second > mp[nr])
nr = it.first;
if(nr == -1)
cout<<-1;
else
cout<<nr<<' '<<mp[nr]<<'\n';
return 0;
}