Cod sursa(job #3195270)
| Utilizator | Data | 20 ianuarie 2024 12:51:36 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <map>
#include <fstream>
using namespace std;
int main()
{
ifstream fin;
ofstream fout;
fin.open("elmaj.in");
fout.open("elmaj.out");
int n, x,maxim=0,indice;
fin >> n;
map<int, int> ve;
for (int i = 0; i < n; i++)
{
fin>> x;
ve[x]++;
}
for(map<int , int>::iterator k=ve.begin(); k!=ve.end();k++)
{
if (k->second>maxim)
{
maxim=k->second;
indice=k->first;
}
}
if (maxim>=(n/2)+1)
{
fout<<indice<<" "<<maxim;
}
else
fout<<"-1";
}