Educational Codeforces Round 86 (Rated for Div. 2)D. Multiple Testcases（数据结构）

原题链接

贪心模拟即可

数据结构牛逼！！！！！！！

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
#include <cstring>
#include <string.h>
#include <queue>
#define ll long long
#include<set>
using namespace std;
inline int read() {
    int k = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { k = k * 10 + ch - '0'; ch = getchar(); }return k * f;
}
struct node
{
    vector<int>ans;
    int cnt;
    bool operator <(const node& q) const
    {
        return cnt > q.cnt;
    }
};
int c[200005];
int a[200005];
bool cmp(int x, int y) { return x > y; }
int main()
{
    priority_queue<node>que;
    
    int n = read(), k = read();
    for (int i = 1; i <= n; i++)a[i] = read();
    for (int i = 1; i <= k; i++)c[i] = read();
    sort(a + 1, a + n + 1, cmp);
    node temp;
    temp.cnt = 0;
    que.push(temp);
    for (int i = 1; i <= n; i++)
    {
        node temp = que.top();
        que.pop();
        if (temp.cnt < c[a[i]])
        {
            while (temp.cnt < c[a[i]])
            {
                temp.ans.push_back(a[i]);
                temp.cnt++;
                i++;
            }
            i--;
        }
        else
        {
            node sim;
            sim.cnt = 0;
            while (sim.cnt < c[a[i]])
            {
                sim.ans.push_back(a[i]);
                sim.cnt++;
                i++;
            }
            i--;
            que.push(sim);
        }
        que.push(temp);
    }
    cout << que.size() << '\n';
    while (!que.empty())
    {
        node temp = que.top();
        que.pop();
        cout << temp.cnt << ' ';
        for (int i = 0; i < temp.cnt; i++)
        {
            cout << temp.ans[i] << ' ';
        }
        cout << '\n';
    }
}