pat 1101. Quick Sort (25)

#include <stdio.h>
#include <algorithm>
#include <climits>

int n, a[100001], min[100001], max, pivots[100001], np;

int main()
{
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++)
{
scanf("%d",&a[i]);
}

max = a[0];
min
= INT_MAX;
min[n - 1] = a[n - 1];

for (int i = n-2; i >=0; i--)
{
min[i] = std::min(min[i+1],a[i]);
}
np = 0;
for (int i = 0; i < n; i++)
{
if (a[i] < min[i+1] && a[i] >=max) {
pivots[np++] = a[i];
}
max = std::max(max, a[i]);
}
std::sort(pivots, pivots + np);
printf("%d\n",np);
for (int i = 0; i < np; i++)
{
if(i==0)	printf("%d",pivots[i]);
else printf(" %d", pivots[i]);
}
printf("\n");
}
return 0;
}