Cod sursa(job #2683666)
Utilizator | Data | 11 decembrie 2020 21:45:15 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
map < int , int > mp;
int n;
int nr;
int maxx=0;
int nrmaxx;
int main()
{
f >> n;
for (int i=1;i<=n;i++) {
f >> nr;
mp[nr] ++;
}
for (auto it=mp.begin();it!=mp.end();++it) {
if (it->second > maxx) {
maxx = it->second;
nrmaxx = it->first;
}
}
if (maxx >= n/2+1) {
g << nrmaxx << " " << maxx;
}
else {
g << -1;
}
return 0;
}