【开源社区openEuler实践】 F. Valuable Cards

题目

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long

const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, base = 37;
const int N = 1e4;
// const int mod = 1e9 + 7;
// const int mod = 998244353;
const __int128 mod = 212370440130137957LL;

int n, m;
int a[maxn], b[maxn];
//long long ? maxn ? n? m?


void solve(){
    ll res = 0;
    int x;
    cin >> n >> x;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    vector&