Cod sursa(job #2350354)
| Utilizator | Data | 21 februarie 2019 11:37:38 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000004];
int main()
{
int n,cand,cont=1,nrap=0;
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
}
cand=v[1];
for(int i=2;i<=n;i++)
{
if(v[i]==cand)
cont++;
else
cont--;
if(cont==0)
{
cand=v[i];
cont=1;
}
}
for(int i=1;i<=n;i++)
{
if(v[i]==cand)
nrap++;
}
if(nrap>n/2)
out<<cand<<" "<<nrap;
else
out<<-1;
return 0;
}
