Cod sursa(job #2388607)
| Utilizator | Data | 26 martie 2019 11:22:56 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
//#include <iostream>
#include <fstream>
#include <vector>
#include <map>
using namespace std;
ifstream cin ("elmaj.in");
ofstream cout ("elmaj.out");
map <int,int> x;
long long n,k,a,maxi,p,i;
int main()
{
cin>>n;
for (i=1;i<=n;++i)
{
cin>>a;
x[a]++;
if (x[a]==1) k++;
}
maxi=-9999;
for (i=1;i<=k;++i)
{
if (x[i]>maxi)
{
maxi=x[i];
p=i;
}
}
if (maxi>=n/2+1) cout<<p<<" "<<maxi;
else cout<<"-1";
return 0;
}
