Cod sursa(job #3277890)
| Utilizator | Data | 17 februarie 2025 19:53:47 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int v[1000009];
int main () {
int n;
cin>>n;
for (int i=1; i<=n; i++)
cin>>v[i];
int candidat=0, k=0;
for (int i=1; i<=n; i++) {
if (!k) candidat=v[i], k=1;
else {
if (v[i]==candidat) k++;
else k--;
}
}
cout<<candidat;
int nr=0;
for (int i=1; i<=n; i++) if (v[i]==candidat) nr++;
if (nr>n/2) cout<<candidat<<' '<<nr;
else cout<<-1;
}