Cod sursa(job #3260173)
| Utilizator | Data | 30 noiembrie 2024 13:58:34 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main () {
ifstream input ("elmaj.in");
ofstream output ("elmaj.out");
int n;
input >> n;
int arr[n];
for (int i = 0; i < n; i++){
input >> arr[i];
}
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < n; j++) {
if (arr[i] == arr[j]) {
count++;
}
}
if (count > n / 2) {
output << arr[i] << ' ' << count;
goto end;
}
}
output << -1;
end:
return 0;
}