Cod sursa(job #2381411)
Utilizator | Data | 16 martie 2019 18:26:41 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include<fstream>
using namespace std;
int v[100000];
int n,k;
int main()
{
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n;
int i;
fin>>n;
for(i=0;i<n;i++)
fin>>v[i];
int aux=0;
int save;
int k=0;
for(i=0;i<n;i++)
{
if(aux==0) {
save = v[i];
aux=1;
}else if(save==v[i]) {
aux++;
}else {
aux--;
}
}
int nr=0;
for(i=0;i<n;i++)
{
if(v[i]==save) nr++;
}
if(nr>n/2) fout<<save<<" "<<nr;
else fout<<-1;
return 0;
}