Cod sursa(job #2231580)
| Utilizator | Data | 14 august 2018 22:58:12 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
#define N 2000000
int n,i,frecv,maj,x[N];
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int main()
{
fin>>n;
fin>>x[1];
maj=x[1];
frecv=1;
for(i=2; i<=n; i++)
{
fin>>x[i];
if(x[i]==maj)frecv++;
else
{
frecv--;
if(frecv<0)maj=x[i],frecv=1;
}
}
frecv=0;
for(i=1; i<=n; i++)
{
fin>>x[i];
if(x[i]==maj)frecv++;
}
fout<<maj<<" "<<frecv;
return 0;
}
