Cod sursa(job #3280449)
| Utilizator | Data | 26 februarie 2025 15:14:53 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int cand=-1, k, x, v[1000005], n;
int main(){
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
if(v[i]==cand) k++;
else{
if(k==0){
cand=v[i];
k=1;
}
else k--;
}
}
k=0;
for(int i=1;i<=n;i++){
if(v[i]==cand)k++;
}
if(k>n/2)
fout<<cand<<' '<<k;
else
fout<<-1;
return 0;
}
