201909-4ccf计算机职业资格认证考试 第四题 推荐系统

// luogu-judger-enable-o2
#include<bits/stdc++.h>
#include<unordered_set>
#define rg register ll
#define inf 2147483647
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
#define ll long long
#define maxn 1000005
#define lb(x) (x&(-x))
const double eps = 1e-6;
using namespace std;
inline ll read()
{
 char ch = getchar(); ll s = 0, w = 1;
 while (ch < 48 || ch>57) { if (ch == '-')w = -1; ch = getchar(); }
 while (ch >= 48 && ch <= 57) { s = (s << 1) + (s << 3) + (ch ^ 48); ch = getchar(); }
 return s * w;
}
inline void write(ll x)
{
 if (x < 0)putchar('-'), x = -x;
 if (x > 9)write(x / 10);
 putchar(x % 10 + 48);
}
struct good
{
    ll id,val;
    good(ll id,ll val):id(id),val(val){}
    bool operator <(const good &a)const 
    {
        return this->val==a.val?this->id <a.id:this->val>a.val;
    }
};
set<good>goods;
unordered_map<ll,set<good>::iterator>p;
ll v[maxn];
const ll Hash=(ll)1e10;
int main()
{
    ll m=read(),n=read();
    for(rg i=1;i<=n;i++)
    {
        ll id=read(),val=read();
        for(rg j=0;j<m;j++)
        {
            ll val1=j*Hash+id;
            p[val1]=goods.insert(good(val1,val)).first;
        }
    }
    ll opps=read();
    for(rg i=1;i<=opps;i++)
    {
        ll check=read();
        if(check==1)
        {
            ll a=read(),b=read(),c=read(),m=a*Hash+b;
            p[m]=goods.insert(good(m,c)).first;
        }
        else if(check==2)
        {
            ll a=read(),b=read(),m=a*Hash+b;
            goods.erase(p[m]),p.erase(m);
        }
        else if(check==3)
        {
            ll sum=read(),cnt=0;
            vector<vector<ll>>ans(m);
            for(rg i=0;i<m;i++)v[i]=read();
            for(auto it:goods)
            {
                ll lei=it.id/Hash,num=it.id%Hash;
                if(ans[lei].size()<v[lei])
                {
                    ans[lei].push_back(num);
                }
                cnt++;
                if(cnt==sum)break;
            }
            for(auto it:ans)
            {
                if(!it.empty())
                {
                    ll k=0;
                    for(auto itt:it)
                    {
                        k++;
                        k==it.size()?cout<<itt<<endl:cout<<itt<<" ";
                    }
                }
                else cout<<-1<<endl;
            }
        }
        
    }
    //while(1)getchar();
    return 0;
}