Cod sursa(job #3292305)
| Utilizator | Data | 7 aprilie 2025 20:25:36 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
unordered_map<int, int> frecv;
int main()
{
int n;
pair<int, int> elMaj = {-1, 0};
f >> n;
for (int i = 1; i <= n; i++)
{
int nr;
f >> nr;
frecv[nr]++;
int crtFreq = frecv[nr];
if (crtFreq >= n / 2 + 1)
{
elMaj = {nr, crtFreq};
}
}
g << elMaj.first;
if (elMaj.first != -1)
{
g << ' ' << elMaj.second;
}
return 0;
}
