Cod sursa(job #2539080)
| Utilizator | Data | 5 februarie 2020 16:39:53 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int maxim = 0, nrMaj, n, v[1000010], frecv[1000010];
int main() {
fin >> n;
for(int i = 1; i <= n; i ++) {
fin >> v[i];
frecv[v[i]] ++;
if(frecv[v[i]] > maxim) {
maxim = frecv[v[i]];
nrMaj = v[i];
}
}
fout << nrMaj << " " << maxim;
}
