E. Serge and Dining Room
题意:有n份菜都有各自的价格ai,有m个人都有各自的钱bi,每个人都会买刚好买的起的最贵的菜吃,除非菜被买完,有q个操作,每次操作要么把第 i 份菜价格改为X,要么把第 i 个人的钱改为x,问每次操作后,是否有菜没被买,如果有,求最贵的价格。
思路:对于所有的菜,我们在线段树中把区间[1, ai] 加上1,对于所有的人,我们在线段树中把区间[1, bi]减上1,如果区间最大值>0,那么说明有的菜没人买,那么我们用线段树求出最大的那个点即可,如果<=0,说明菜被买完了,输出-1
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10, N = 1e6;
int mx[maxn * 4], tag[maxn * 4], a[maxn], b[maxn];
void pushdown(int o, int ls, int rs) {
if (tag[o] != 0) {
tag[ls] += tag[o];
tag[rs] += tag[o];
mx[ls] += tag[o];
mx[rs] += tag[o];
tag[o] = 0;
}
}
void up(int o, int l, int r, int ql, int qr, int v) {
if (l >=ql && r <= qr) {
mx[o] += v;
tag[o] += v;
return;
}
int m = (l + r) / 2, ls = o * 2, rs = o * 2 + 1;
pushdown(o, ls, rs);
if (ql <= m)
up(ls, l, m, ql, qr, v);
if (qr > m)
up(rs, m + 1, r, ql, qr, v);
mx[o] = max(mx[ls], mx[rs]);
}
int qu(int o, int l, int r) {
if (l == r)
return l;
int m = (l + r) / 2, ls = o * 2, rs = o * 2 + 1;
pushdown(o, ls, rs);
if (mx[rs] > 0)
return qu(rs, m + 1, r);
return qu(ls, l, m);
}
int main() {
int n, m, q, opt, x, y;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
up(1, 1, N, 1, a[i], 1);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
up(1, 1, N, 1, b[i], -1);
}
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &opt, &x, &y);
if (opt == 1) {
up(1, 1, N, 1, a[x], -1);
a[x] = y;
up(1, 1, N, 1, a[x], 1);
}
else {
up(1, 1, N, 1, b[x], 1);
b[x] = y;
up(1, 1, N, 1, b[x], -1);
}
if (mx[1] <= 0)
puts("-1");
else
printf("%d\n", qu(1, 1, N));
}
}