Cod sursa(job #2982632)
Utilizator | Data | 20 februarie 2023 16:42:03 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
map <long long , int> fr;
int n , i , gasit , nr;
long long val , x;
int main()
{
f >> n;
for (int i = 1 ; i <= n ; i++)
{
f >> x;
fr[x]++;
if (fr[x] > n / 2)
{
gasit = 1;
val = x;
nr = fr[x];
}
}
if (gasit == 0)
g << -1;
else
g << val << " " << nr;
return 0;
}