#include <iostream>
#include <string>
#include <deque>
#include <iomanip>
#include <vector>
#include <random>
#include <algorithm>

using namespace std;



void solve(vector<int> &array, vector<int> &res)
    {
       for (int i = 0; i < array.size(); i++)
           {
               vector<bool> flag;
               int newSize = array.size() - i;
               flag.resize(newSize);
               for (int j = 0; j < array.size() - i; j++)
                   {
                       int z = 0;
                       if (array[i] < array[j])
                           {
                               break;
                           }
                       if (array[i] > array[j])
                           {
                               flag[z++] = true;
                           }
                       if (array[j] == array.front())
                           {
                               int newSize2 = 0;
                               for (int x = 0; x < newSize; x++)
                                   {
                                       if (flag[x])
                                           {
                                               newSize2++;
                                           }
                                   }
                           if (newSize2 == newSize)
                               {
                                   res.push_back(array[i]);
                                   break;
                               }
                           }
                   }
           }
    }

int main()
    {

        vector<int> V = {75,47,42,56,13,55};
        vector<int> res;

        solve(V,res);

        for (int i = 0; i < res.size(); i++)
            {
                cout << res[i] << '\t';
            }
    }