糖糖别胡说，我真的不是签到题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 5e4 + 10;
int t,n,m,max0,max1;
struct node{
    int a,b;
}e[maxn];
int c[maxn];
int cnt;
signed main() {
   // freopen("in","r",stdin);
    ios::sync_with_stdio(0);
    cin >> t;
    while(t--){
        cin >> n >> m;
        for(int i = 1; i <= n; i++)
            cin >> e[i].a >> e[i].b;
        memset(c,0,sizeof(c));
        for(int i = 1; i <= m; i++) {
            int x;
            cin >> x;
            c[x]++;
        }
        for(int i = n; i >= 1; i--){
            c[i] += c[i + 1];
            e[i].b += c[i];
        }
        max0 = max1 = cnt = 0;
        for(int i = n; i >= 1; i--){
            if(!e[i].a){
                max0 = max(max0,e[i].b);
                if(max1 > e[i].b)
                    cnt++;

            }else{
                max1 = max(max1,e[i].b);
                if(max0 > e[i].b)
                    cnt++;
            }
        }
        cout << n - cnt << endl;
    }
    return 0;
}