Cod sursa(job #2635243)
Utilizator | Bogdan Rulea BogdanRulea | Data | 13 iulie 2020 19:37:53 |
---|---|---|---|
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> m;
pair <int,int> maxim;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
m[x]++;
if(maxim.second<m[x])
{
maxim.second=m[x];
maxim.first=x;
}
}
maxim.second>=n/2+1?(cout<<maxim.first<<" "<<maxim.second):cout<<-1;
return 0;
}