Cod sursa(job #2956411)
Utilizator | Data | 19 decembrie 2022 15:17:34 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
map<int,int>m;
int main()
{
int n;
fin>>n;
for(int i=1 ; i<=n ; i++)
{
int x;
fin>>x;
m[x]++;
}
int ok=0;
for(auto i:m)
{
if(i.second>=n/2+1)
{
fout<<i.first<<" "<<i.second;
ok=1;
break;
}
}
if(ok==0)
fout<<-1;
return 0;
}