消灭兔子 51Nod - 1191

​​http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1191​​

对兔子和弓箭分别按b与d降序排序 扫一遍兔子 当前兔子就是所有存活兔子中最抗揍的 只能从所有能干掉它的弓箭里选一个 贪心的话就选最便宜的 线段树维护一下即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=0x3f3f3f3f3f3f3f3f;
const int maxn=5e4+10;

struct node
{
    int d;
    ll p;
};

node ary[maxn];
ll minn[4*maxn],id[4*maxn];
int b[maxn];
int n,m;

bool cmp(node n1,node n2)
{
    return n1.d>n2.d;
}

void pushup(int cur)
{
    if(minn[2*cur]<minn[2*cur+1])
    {
        minn[cur]=minn[2*cur];
        id[cur]=id[2*cur];
    }
    else
    {
        minn[cur]=minn[2*cur+1];
        id[cur]=id[2*cur+1];
    }
}

void build(int l,int r,int cur)
{
    int m;
    if(l==r)
    {
        minn[cur]=ary[l].p;
        id[cur]=l;
        return;
    }
    m=(l+r)/2;
    build(l,m,2*cur);
    build(m+1,r,2*cur+1);
    pushup(cur);
}

void query(ll &val,int &res,int pl,int pr,int l,int r,int cur)
{
    int m;
    if(pl<=l&&r<=pr)
    {
        if(val>minn[cur])
        {
            val=minn[cur];
            res=id[cur];
        }
        return;
    }
    m=(l+r)/2;
    if(pl<=m) query(val,res,pl,pr,l,m,2*cur);
    if(pr>m) query(val,res,pl,pr,m+1,r,2*cur+1);
}

void update(int tar,int l,int r,int cur)
{
    int m;
    if(l==r)
    {
        minn[cur]=N;
        return;
    }
    m=(l+r)/2;
    if(tar<=m) update(tar,l,m,2*cur);
    else update(tar,m+1,r,2*cur+1);
    pushup(cur);
}

int main()
{
    ll ans,val;
    int i,l,r,mid,p,res;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) scanf("%d",&b[i]);
    for(i=1;i<=m;i++) scanf("%d%lld",&ary[i].d,&ary[i].p);
    sort(b+1,b+n+1);
    sort(ary+1,ary+m+1,cmp);
    build(1,m,1);
    ans=0;
    for(i=n;i>=1;i--)
    {
        l=1,r=m,p=-1;
        while(l<=r)
        {
            mid=(l+r)/2;
            if(ary[mid].d>=b[i]) l=mid+1,p=mid;
            else r=mid-1;
        }
        if(p==-1) break;
        val=N,res=-1;
        query(val,res,1,p,1,m,1);
        if(res==-1) break;
        ans+=val;
        update(res,1,m,1);
    }
    if(i!=0) printf("No Solution\n");
    else printf("%lld\n",ans);
    return 0;
}