【PAT】1045快速排序

#include <iostream>
#include <algorithm> 
using namespace std;

int main(){
	int n;
	int *a,*b,*c;
	cin>>n;
	a = new int[n + 1];
	b = new int[n + 1];
	c = new int[n + 1];
	for(int i = 0; i < n ; i++){
		cin>>a[i];
		b[i] = a[i];
	} 
	sort(a,a + n);
	int k = 0;
	int max = 0;
	for(int i = 0; i < n; i++){
		if(b[i] > max) max = b[i];
		if(a[i] == b[i] && max == a[i]){
			c[k++] = b[i];
		}
	}
	cout<<k<<endl;
	if(k == 0) cout<<endl;
	for(int i = 0; i < k; i++){
		if(i != 0)
			cout<<" ";
			cout<<c[i];	
	}
	
	
	return 0;
}

测试点3的坑就是，如果没有数输出，要输出空格