Cod sursa(job #2368823)
Utilizator | Data | 5 martie 2019 18:29:10 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int cand, n, v[1000003], i, k, ap;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
cand=v[1];
k=1;
for(i=2; i<=n; i++)
{
if(v[i]==cand)
k++;
else
{
k--;
}
if(k<0)
cand=v[i];
}
ap=0;
for(i=1; i<=n; i++)
{
if(v[i]==cand)
ap++;
}
if(ap>n/2)
fout<<cand<<" "<<ap;
else
fout<<-1;
return 0;
}