Cod sursa(job #2559171)
| Utilizator | Data | 27 februarie 2020 09:06:56 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[1000002];
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,candidat=0,nr=1;
fin>>n;
for(int i=1;i<=n;i++){
fin>>x[i];
if(x[i]==candidat){
nr++;
}else{
if(nr==1){
candidat=x[i];
}else{
nr--;
}
}
}
nr=0;
for(int i=1;i<=n;i++){
if(x[i]==candidat){
nr++;
}
}
if(nr==n/2+1){
fout<<candidat<<" "<<nr;
}else{
fout<<-1;
}
return 0;
}
