Cod sursa(job #2962024)
Utilizator | Alin Pop alin_simplu | Data | 7 ianuarie 2023 17:24:08 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
const int Dim = 2 * (1 << 20);
int x[Dim], n;
int nr_ap_max, nr;
int main(){
fin >> n;
int a;
for (int i = 1; i <= n; ++i){
fin >> a;
x[a] ++;
}
for (int i = 1; i <= n; ++i){
if (nr_ap_max < x[i]){
nr_ap_max = x[i];
nr = i;
}
}
if (nr_ap_max >= (n / 2 + 1))
fout << nr << ' ' << nr_ap_max;
else
fout << -1;
return 0;
}