Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <array>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- const int arrSize = 20;
- int inputNumber = 0;
- cin >> inputNumber;
- array <int, arrSize> arr1;
- for (int i = 0; i < inputNumber; i++) {
- cin >> arr1[i];
- }
- int countNumbers = 0;
- int mostFrequentNumber = 0;
- vector <int> resultContainer;
- for (int y = 0; y < inputNumber; y++) {
- for (int z = y+1; z < inputNumber; z++) {
- if (arr1[y] == arr1[z]) {
- countNumbers++;
- }
- }
- if (countNumbers >= mostFrequentNumber) {
- mostFrequentNumber = countNumbers;
- resultContainer.push_back(arr1[y]);
- }
- countNumbers = 0;
- }
- sort(resultContainer.begin(), resultContainer.end());
- for (int k : resultContainer) {
- cout << k << " ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement