Cod sursa(job #2414806)
| Utilizator | Data | 25 aprilie 2019 09:16:28 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
/**
* @Author: catalin <catalin>
* @Date: 25-Apr-2019
* @Last modified by: catalin
* @Last modified time: 25-Apr-2019
*/
#include <fstream>
std::ifstream fin("elmaj.in");
std::ofstream fout("elmaj.out");
const int NMAX = 1000001;
int fr[NMAX], x, N, maximal = -1;
int main() {
fin >> N;
for (int i = 0; i < N; ++i) {
fin >> x;
fr[x]++;
if (fr[x] >= N / 2 + 1)
maximal = x;
}
if (maximal == -1)
fout << maximal;
else
fout << maximal << ' ' << fr[maximal];
fin.close();
fout.close();
return 0;
}
