UMRbx!!!

https://www.luogu.com.cn/problem/P3378#include<bits/stdc++.h>using namespace std;int n, op, x; priority_queue<int>que;int main() { cin >> n; while(n--) { cin >> op; if(op == 1) { cin >> x; que.push(-x); }

#include&lt;bits/stdc++.h&gt;using namespace std;int n, m, tl, hed[505], mp[505], cnt, f[505], jb[505], pre[505];int inx, vis[505];struct node { int v, nxt;}e[500005];void add(int u, int v) {...

回文字动机模板#include&lt;bits/stdc++.h&gt;using namespace std;typedef long long ll;char s[300005];int n, las, fil[300005], nx[300005][35], len[300005], tot, rt, now, cnt[300005];ll ans;int newnode(...

#include&lt;bits/stdc++.h&gt;using namespace std;typedef long long ll;int n;ll ans;ll p[1005];struct node { ll id, w;}e[1005];bool cmp(node x, node y) { return x.w &gt; y.w;}ll pd(ll x) {...