Cod sursa(job #2605326)
Utilizator | Data | 24 aprilie 2020 19:09:44 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int,int> a;
int main()
{
int n,nr,maxi=-1;
f>>n;
for(int i=1;i<=n;i++){
f>>nr;
a[nr]++;
if(a[nr]>=n/2+1){
maxi=nr;
}
}
if(maxi==-1)g<<-1;
else{
g<<maxi<<" "<<a[maxi];
}
return 0;
}