Cod sursa(job #2295304)
Utilizator | Data | 3 decembrie 2018 15:27:21 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int, int>mp;
int n, q, ap;
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
{
int nr;
f >> nr;
mp[nr]++;
if(mp[nr] >= n/2+1)
q = nr, ap = mp[nr];
}
if(q != 0)
g << q << " " << ap << '\n';
else
g << -1;
return 0;
}