Cod sursa(job #2794320)
Utilizator | Data | 4 noiembrie 2021 17:41:14 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
unordered_map<int,int> f;
int main(){
int n,maj,nr;
in>>n;
for(int i=0;i<n;i++){
in>>nr;
if(++f[nr]>f[maj])maj=nr;
}
if(f[maj]>=n/2+1)out<<maj<<' '<<f[maj];
else out<<-1;
}