Cod sursa(job #1331151)
| Utilizator | Data | 31 ianuarie 2015 12:43:59 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.88 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
fstream fin("elmaj.in",ios::in),
fout("elmaj.out",ios::out);
int v[1000000];
int main()
{
int n,j,apare=1,p,nr=0,i;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
if(v[i]==v[i+1])
{
apare++;
}
else
{
if(apare>0)
{
apare--;
}
else
{
if(apare<1)
{
v[i]=v[i+1];
apare=1;
}
}
}
}
apare=0;
for(j=1;j<=n;j++)
{
if(v[j]==v[i])
{
apare++;
}
}
if(apare==n/2)
{
fout<<v[j];
}
fin.close();
fout.close();
}
