Cod sursa(job #3164871)
Utilizator | Pap-Czier Peter PapCzierPeter | Data | 4 noiembrie 2023 16:22:26 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,p,x[10],z=0,i;
f>>n;n=n/2+1;
for (i=0;i<=9;i++) x[i]=0;
while (f>>p) {for (i=0;i<=9;i++){ if (i==p) x[i]++;}}
for (i=0;i<=9;i++) if (x[i]>=n) { g<<i<<" "<<x[i];z=1;}
if (z==0)g<<-1;
f.close();
g.close();
return 0;
}