Codeforces 847B - Preparing for Merge Sort

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))

const int N=2e5+5;
int a[N];
vector<int>ans[N];
int Max[N];
int main()
{
    /*ios::sync_with_stdio(false);
    cin.tie(0);*/
    
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    
    int cnt=0;
    for(int i=0;i<n;i++)
    {
        if(ans[cnt].size()!=0&&a[i]<=ans[cnt].back())
        {
            ans[++cnt].pb(a[i]);
            continue;
        }
        else if(ans[cnt].size()==0)ans[cnt].pb(a[i]);
        for(int j=0;j<=cnt;j++)
        {
            if(ans[j].size()==0||a[i]>ans[j].back())
            {
                ans[j].pb(a[i]);
                break;
            }
        }
    }
    
    for(int i=0;i<=cnt;i++)
    {
        for(int j=0;j<ans[i].size();j++)
        {
            printf("%d ",ans[i][j]);
        }
        printf("\n");
    }
    return 0;
}