Cod sursa(job #3183939)
| Utilizator | Data | 13 decembrie 2023 18:42:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int t[1000005];
int main()
{
int i,nrfrumos,aparitie=1,nrnr;
fin>>nrnr;
for (i=1;i<=nrnr;i++)
fin>>t[i];
nrfrumos=t[1];
for (i=2;i<=nrnr;i++)
{
if (t[i]==nrfrumos)
{
aparitie++;
}
else if (aparitie>0)
aparitie--;
else
nrfrumos=t[i];
}
aparitie=0;
for (i=1;i<=nrnr;i++)
if(t[i]==nrfrumos)
aparitie++;
fout<<nrfrumos<<' '<<aparitie;
return 0;
}
