Cod sursa(job #2500580)
Utilizator | Data | 28 noiembrie 2019 11:33:27 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n, i, j, f[1000000], nr;
ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");
int main () {
fin>>n;
for (i=1;i<=n;i++) {
fin>>f[i];
}
for (i=1;i<=n;i++) {
nr = 0;
for (j=1;j<=n;j++) {
if (f[i]==f[j])
nr++;
}
if (nr>n/2) {
fout<<f[i]<<" "<<nr;
return 0;
}
}
fout<<-1;
return 0;
}