PAT A 1101 Quick Sort

#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++){
        scanf("%d",&a[i]);
        b[i]=a[i];
    }
    sort(b,b+n);
    int Max=-1;
    for(int i=0;i<n;i++){
        if(a[i]==b[i]&&a[i]>Max)    v.push_back(a[i]);
        if(a[i]>Max)                Max=a[i];
    }
    printf("%d\n",v.size());
    for(int i=0;i<v.size();i++){
        if(i==0)    printf("%d",v[i]);
        else        printf(" %d",v[i]);
    }
    printf("\n");
    return 0;
}