Cod sursa(job #2416785)
Utilizator | Data | 28 aprilie 2019 11:16:12 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main()
{
map<int,int> ap;
int n,x;
in>>n;
for(int i = 0; i < n; ++i){
in>>x;
ap[x]++;
}
n=n/2+1;
int rez = -1;
for(auto i : ap)
if(i.second >= n){
rez = i.first;
break;
}
out<<rez<<" ";
if(rez!=-1)
out<<ap[rez];
return 0;
}