Cod sursa(job #1519169)
Utilizator | Data | 6 noiembrie 2015 22:18:36 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
long long n;
long long p=0,i,v[1000050],nr=0,k=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]!=nr)
{
k--;
}
else
{
k++;
}
if(k<0)
{
k=1;
nr=v[i];
}
}
k=0;
for(i=1;i<=n;i++)
{
if(nr==v[i])
{
k++;
}
}
if(k>=n/2)
{
fout<<nr;
}
return 0;
}
/* ex: n=7
2 2 3 1 2 2 3 => 2*/