PAT甲级1101 Quick Sort (25 分)

模拟

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    
    
    int n;
    vector<int> v;
    cin>>n;
    int a[n],b[n];
    for(int i=0;i<n;i++){
    
    
        cin>>a[i];
        b[i]=a[i];
    }
    sort(a,a+n);
    int max=0;
    for(int i=0;i<n;i++){
    
    
        if(a[i]==b[i] && max<a[i])v.push_back(a[i]);
        if(max<b[i])max=b[i];
    }
    cout<<v.size()<<endl;
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
    
    
        if(i)cout<<' ';
        cout<<v[i];
    }
    cout<<endl;
    return 0;
}