Cod sursa(job #2388603)
| Utilizator | Data | 26 martie 2019 11:20:11 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
long long n,a,i,maxi;
map <long long,long long> p;
int main()
{
cin>>n;
for(i=1;i<=n;++i)
{
cin>>a;
p[a]++;
}
maxi=-1;
a=-1;
for(auto e:p)
if(e.second>=n/2+1 && e.second>maxi)
{
maxi=e.second;
a=e.first;
}
cout<<a<<" "<<maxi;
return 0;
}
