Cod sursa(job #2392097)
Utilizator | Data | 29 martie 2019 17:37:05 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int, int>mp;
int n, p, x, nr, minim, k, ans;
int main()
{
f>>n;
minim=n/2+1;
for(int i=1; i<=n; i++)
{
f>>x;
mp[x]++;
if(minim<=mp[x])
{
ans=x;
}
}
if(!ans)
{
g<<-1;
return 0;
}
else
{
g<<ans<<' '<<mp[ans];
return 0;
}
return 0;
}