1045 快速排序 (25 分)

#include <iostream>
#include<string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	int N;
	cin>>N;
	vector<int>list(N);
	vector<int>list2;
	vector<int>list3;
	for (int i = 0;i < N;i++) {
		cin>>list[i];
	}
	list2 = list;
	int max = 0;
	sort(list.begin(), list.end());
	for (int i = 0;i < list.size();i++) {
		if (list2[i] == list[i] && list2[i] > max) {
			list3.push_back(list2[i]);
		}
		if (list2[i] > max) {
			max = list2[i];
		}		
	}
        cout << list3.size() << endl;
		for (int i = 0;i < list3.size();i++) {			
			if (i != list3.size() - 1) {
				cout << list3[i] << " ";
			}
			else { cout << list3[i]; }
		}
        cout<<endl;
        return 0;
	}