1101. Quick Sort (25)

#include<iostream>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<stack>
using namespace std;


        

int main() {
    
    int num;
    cin >> num;
    vector<int> arr;
    vector<int> ori;
    for (int i = 0; i < num; i++) {
        int temp;
        cin >> temp;
        ori.push_back(temp);
        arr.push_back(temp);
    }

    sort(arr.begin(), arr.end());
    vector<int> ans;
    int c=0;
    int max = 0;
    for (int i = 0; i < num; i++) {
        if (ori[i] == arr[i] && ori[i]>max) {
            c++;
            ans.push_back(arr[i]);
        }

        if (ori[i] > max) {
            max = ori[i];
        }
    }

    cout << c << endl;

    for (int i = 0; i < ans.size(); i++) {
        if (i == 0) {
            cout << ans[i];
        }

        else
            cout << ‘ ‘ << ans[i];
    }
    

    system("pause");
    
}