Cod sursa(job #2532493)
| Utilizator | Data | 27 ianuarie 2020 21:20:22 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
const int lim=1e5+3;
int v[lim];
unordered_map<int,int> m;
int main()
{
int n,lim;
cin>>n;
lim=n/2+1;
for(int i=1;i<=n;++i)
cin>>v[i],m[v[i]]++;
for(int i=1;i<=n;++i)
if(m[v[i]]>=lim)
{
cout<<v[i]<<' '<<m[v[i]];
return 0;
}
cout<<-1;
return 0;
}
