Cod sursa(job #3036936)
Utilizator | Data | 25 martie 2023 11:34:18 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
int v[1000000];
fstream f("elmaj.in", ios::in), g("elmaj.out", ios::out);
unordered_map<int, int> m;
int main()
{
srand(time(0));
int n;
f >> n;
for (int i = 0; i < n; i++)
f >> v[i], m[v[i]]++;
for (int i = 0; i < 0; i++)
{
int j = rand() % n;
if (m[v[j]] > n / 2)
{
g << v[j] << ' ' << m[v[j]];
return 0;
}
}
g << -1;
}