Poistot

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> index_set;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
 
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
 
constexpr ll MOD = 1000000007;

vector<int> k[100100];
map<int, int> km;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    int px = INT_MAX, ck = 0, mk = 0;
    FOR(i,0,n) {
        int x; cin >> x;
        if (x <= px) {
            ck++;
        }
        else {
            int maai = -1;
            for (auto i : km) {
                if (i.S < x) {maai = i.F; break;}
            }
            ck = maai;
        }
        k[ck].PB(x);
        km[ck] = x;
        mk = max(ck, mk);
        px = x;
    }
    cout << mk << "\n";
    FOR(i,1,mk+1) {
        for (int i : k[i]) {
            cout << i << " ";
        } 
        cout << "\n";
    }

}

Test 1

Group: 1, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: RUNTIME ERROR

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: RUNTIME ERROR

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED