Cod sursa(job #1663951)
| Utilizator | Data | 26 martie 2016 11:33:22 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int N,i,x[1000005],k,em;
int main()
{
fin>>N;
for(i=0;i<N;i++)
{
fin>>x[i];
if(x[i]!=em)
k--;
else
k++;
if(k<0)
{
em=x[i];
k=1;
}
}
k=0;
for(i=0;i<N;i++)
{
if(x[i]==em){k++;}
}
if(k>N/2)
{
fout<<em<<" "<<k<<"\n";
}
else
{
fout<<"-1\n";
}
return 0;
}
