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