Cod sursa(job #2511504)
Utilizator | Data | 19 decembrie 2019 10:21:52 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int,int> M;
int n,v,cnt;
int main()
{
f >> n;
for( int i=1 ; i<=n ; i++)
{
f>>v;
M[v]++;
}
for(auto it : M)
{
tie(v,cnt)=it;
if(cnt>n-cnt)
{
g<<v<<' '<<cnt;
return 0;
}
}
g<<"-1\n";
return 0;
}