Cod sursa(job #2368018)
| Utilizator | Data | 5 martie 2019 13:21:41 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj,out");
int v[1000000],ap,cd,n,i;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
cd=v[1];
for(i=2;i<=n;i++)
{
if(v[i]==cd)
{
ap++;
}
else
{
ap--;
}
if(ap==-1)
{
cd=v[i];
}
}
ap=0;
for(i=1;i<=n;i++)
{
if(v[i]==cd)
ap++;
}
if(ap>n/2)
g<<cd<<" "<<ap;
f.close();
g.close();
}
