jzoj5849 d 线段树

Description

---

Solution

---

考虑按a升序排序。可以发现答案为min(a)*min(b)，那么我们枚举a[i]作为最小的a，查询第m-i+1小的b更新答案
注意每次要删掉最小的a，即一个矩形不能被删多于一次

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define fill(x,t) memset(x,t,sizeof(x))
#define fi first
#define se second

typedef long long LL;
typedef std:: pair <LL,LL> pair;
const int N=100005;

pair d[N];

int size[N<<2];

int read() {
    int x=0,v=1; char ch=getchar();
    for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
    for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
    return x*v;
}

int kth(int now,int tl,int tr,int k) {
    if (tl==tr) return tl;
    int mid=(tl+tr)>>1;
    if (size[now<<1]>=k) return kth(now<<1,tl,mid,k);
    else return kth(now<<1|1,mid+1,tr,k-size[now<<1]);
}

void modify(int now,int tl,int tr,int x,int v) {
    size[now]+=v;
    if (tl==tr) return ;
    int mid=(tl+tr)>>1;
    if (x<=mid) modify(now<<1,tl,mid,x,v);
    else modify(now<<1|1,mid+1,tr,x,v);
}

int main(void) {
    freopen("d.in","r",stdin);
    freopen("d.out","w",stdout);
    for (int T=read();T--;) {
        int n=read(),m=read();
        rep(i,1,n) {
            d[i].fi=read(),d[i].se=read();
        }
        std:: sort(d+1,d+n+1);
        rep(i,1,n) modify(1,1,N,d[i].se,1);
        LL ans=d[1].fi*kth(1,1,N,m+1);
        rep(i,1,m) {
            modify(1,1,N,d[i].se,-1);
            LL min=kth(1,1,N,m-i+1);
            ans=std:: max(ans,min*d[i+1].fi);
        }
        printf("%lld\n", ans);
        rep(i,m+1,n) modify(1,1,N,d[i].se,-1);
    }
    return 0;
}