Cod sursa(job #2127845)
Utilizator | Data | 11 februarie 2018 09:44:34 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,pot=-1,lr,v[1000001],fr;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
if(v[i]==pot)
fr++;
else
{
fr--;
if(fr<0)
{
pot=v[i];
fr=1;
}
}
}
fr=0;
for(i=1;i<=n;i++)
if(v[i]==pot)
fr++;
if(fr>n/2)
fout<<pot<<' '<<fr;
return 0;
}