UVALive 4731 dp+贪心

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define LL __int64
using namespace std;
struct node
{
    int x,y;
    bool operator < (const node&rhs) const
    {
        if (x==rhs.x) return y<rhs.y;
        return x<rhs.x;
    }
}tasks[100010];
bool cmp(node a,node b)
{
    if (a.x==b.x) return a.y<b.y;
    return a.x<b.x;
}
int n,m;
multiset<node> v;
multiset<node>::iterator it;
/*
int bs(int p,int q)
{
    int L=0,R=v[p].size(),mid;
    while (L<R)
    {
        mid=(L+R)>>1;
        if (v[p][mid]<tasks[q].x) L=mid+1;
        else R=mid;
    }
    return L;
}
*/
int main()
{
    int a,b;
    while (scanf("%d%d",&m,&n)!=EOF)
    {
        int maxn=0;
        v.clear();
        for (int i=1;i<=m;i++){
            scanf("%d%d",&a,&b);
            v.insert((node){a,b});
            maxn=max(b,maxn);
        }
        for (int i=1;i<=n;i++){
            scanf("%d%d",&a,&b);
            tasks[i].x=a;
            tasks[i].y=b;
        }
        sort(tasks+1,tasks+1+n);
        //for (int i=0;i<=maxn;i++) sort(v[i].begin(),v[i].end());
        LL ans=0;
        int sum=0;
        for (int i=n;i>=1;i--){
            it=v.lower_bound(tasks[i]);
                if (it==v.end()) continue;
                else{
                    v.erase(it);
                    ans+=(LL)tasks[i].x*500+(LL)tasks[i].y*2;
                    sum++;

                }
        }
        printf("%d %I64d\n",sum,ans);
    }
    return 0;
}