Cod sursa(job #2605315)
Utilizator | Brindea Robert Robert.Brindea | Data | 24 aprilie 2020 19:00:09 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout("elmaj.out");
unordered_map<int, int> f;
int n;
int elem, cont;
int main()
{
fin >> n;
for(int i = 0; i < n; i++)
{
int val;
fin >> val;
f[val]++;
if(f[val] > cont)
{
elem = val;
cont = f[val];
}
}
if(cont >= n/2+1)
fout << elem << " " << cont;
else
fout << "-1";
return 0;
}