Pagini recente » Cod sursa (job #2910721) | Cod sursa (job #2423485) | Cod sursa (job #1703094) | Atasamentele paginii like_oji_18_10 | Cod sursa (job #3260173)
#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;
}