“华为杯“华南理工大学程序设计竞赛 L-再一道好题

题目

法一：

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
const int maxn = 1e6 + 5;
const int inf = 1e9 + 5;

using namespace std;

int n, m;

void solve(){
    int res = 0;
	int q;
    string s;
    int k;
	cin >> n >> q;
    vector<int> tim(n + 5);
    set<pair<int, int>> S;
    int tot = 0;
    for(int i = n; i >= 1; i--){
        tim[i] = ++tot;
        S.insert({tim[i], i});
    }
    while(q--){
        int op, x;
        cin >> op;
        if(op == 1){
            cin >> x;
            S.erase({tim[x], x});