Cod sursa(job #3266557)
| Utilizator | Data | 9 ianuarie 2025 14:17:26 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e6+2;
int n,v[NMAX];
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main() {
fin >> n;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
nth_element(v+1, v+n/2, v+n+1);
int cand = v[n/2], vf = 0;
for(int i = 1; i <= n; i++){
vf += (v[i] == cand);
}
if(vf >= n/2+1){
fout << cand << " " << vf;
}else{
fout << "-1";
}
return 0;
}
