Cod sursa(job #2189953)
Utilizator | Data | 29 martie 2018 14:48:39 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,cand,k,i,x,a[1000001],nr;
int main()
{
f>>n;
cand=-1;k=0;
for(i=1;i<=n;i++)
{
f>>x;
a[i]=x;
if(k==0)
{
cand=x;
k=1;
}
else
{
if(x==cand)
k++;
else
k--;
}
}
for(i=1;i<=n;i++)
{
if(a[i]==cand)
nr++;
}
if(nr>n/2)
g<<cand<<' '<<nr;
else g<<-1;
}