CCF CSP 推荐系统

#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
#include <unordered_map>
#define LL long long
#define PII pair<LL,LL>
using namespace std;
const LL MUL = 1e9 + 10;
unordered_map<LL,int> scores;
set<PII> goods;
int n,m;
int main()
{
    cin >> m >> n;
    for(int i = 0; i < n; ++i)
    {
        int id,score;
        scanf("%d%d",&id,&score);
        for(int j = 0; j < m; ++j)
        {
            goods.insert({-score, id + j * MUL});
            scores[j * MUL + id] = score;
        }
    }
    int k; cin >> k; 
    while(k --)
    {
        int op; scanf("%d",&op);
        if(op == 1)
        {
            int x, id, score; scanf("%d%d%d",&x,&id,&score);
             goods.insert({-score, id + x * MUL});
            scores[(LL)x * MUL + id] = score;
        }