先都按价格排序
从小到大枚举稻草,同时将价格小于他的牛记录一下(被记录的都满足价格够了)
然后找这个稻草鲜嫩度的前驱(可以相等)(这个草能满足的最大的鲜嫩度)
用Splay就可以了
代码如下:
#include<algorithm>
#include<ctype.h>
#include<cstdio>
#define INF 2147483647
#define N 100050
using namespace std;
inline int read(){
int x=0,f=1;char c;
do c=getchar(),f=c=='-'?-1:f; while(!isdigit(c));
do x=(x<<3)+(x<<1)+c-'0',c=getchar(); while(isdigit(c));
return x*f;
}
struct Data{
int x,k;
}a[N],b[N];
inline bool cmp(Data a,Data b){
return a.x<b.x;
}
struct Node{
Node *ch[2],*fa;
int x,siz,cnt;
Node(int);
inline void maintain(){
siz=cnt+ch[0]->siz+ch[1]->siz;
return;
}
inline int cmp(int k){
if(x==k) return -1;
return k<x?0:1;
}
inline int dir(){
if(fa->ch[0]==this) return 0;
if(fa->ch[1]==this) return 1;
return -1;
}
}*root,*null,*tmp;
Node::Node(int _):x(_){
siz=cnt=1;
fa=ch[0]=ch[1]=null;
}
inline void init(){
null=new Node(-1);
null->fa=null->ch[0]=null->ch[1]=null;
null->cnt=null->siz=0;
root=null;
return;
}
inline void Rotate(Node *x,int d){
Node *k=x->ch[d^1];
x->ch[d^1]=k->ch[d];
if(x->ch[d^1]!=null) x->ch[d^1]->fa=x;
k->ch[d]=x;
if(x->fa!=null) x->fa->ch[x->dir()]=k;
k->fa=x->fa;x->fa=k;
x->maintain();k->maintain();
return;
}
inline void Splay(Node *x,Node *y){
while(x->fa!=y){
if(x->fa->fa!=y && x->dir()==x->fa->dir())
Rotate(x->fa->fa,x->dir()^1);
Rotate(x->fa,x->dir()^1);
}
if(y==null) root=x;
return;
}
void Insert(int k,Node *&x,Node *fa){
if(x==null){
x=new Node(k);
x->fa=fa;
tmp=x;
return;
}
int d=x->cmp(k);
if(!~d){
x->cnt++;x->siz++;
tmp=x;
}
else Insert(k,x->ch[d],x);
x->maintain();
return;
}
inline void AddNew(int x){
Insert(x,root,null);
Splay(tmp,null);
return;
}
Node *LowerPointer(int k,Node *x){
if(x==null) return null;
if(x->x>=k) return LowerPointer(k,x->ch[0]);
tmp=LowerPointer(k,x->ch[1]);
return tmp==null?x:tmp;
}
Node *UpperPointer(int k,Node *x){
if(x==null) return null;
if(x->x<=k) return UpperPointer(k,x->ch[1]);
tmp=UpperPointer(k,x->ch[0]);
return tmp==null?x:tmp;
}
int Lower(int k,Node *x){
if(x==null) return -INF;
if(x->x>k) return Lower(k,x->ch[0]);
return max(x->x,Lower(k,x->ch[1]));
}
Node *reduce(Node *&x){
if(x->cnt>1){
x->cnt--;x->siz--;
return x;
}
return null;
}
inline void Delete(int k){
Node *a=LowerPointer(k,root),*b=UpperPointer(k,root);
if(a==null && b==null){
root=reduce(root);
return;
}
if(a==null){
Splay(b,null);
root->ch[0]=reduce(root->ch[0]);
root->maintain();
return;
}
if(b==null){
Splay(a,null);
root->ch[1]=reduce(root->ch[1]);
root->maintain();
return;
}
Splay(a,null);Splay(b,a);
root->ch[1]->ch[0]=reduce(root->ch[1]->ch[0]);
root->ch[1]->maintain();root->maintain();
return;
}
int n,m,k,t;
long long ans;
int main(){
init();
n=read();m=read();
for(int i=1;i<=n;i++){
a[i].x=read();a[i].k=read();
}
for(int i=1;i<=m;i++){
b[i].x=read();b[i].k=read();
}
sort(a+1,a+n+1,cmp);sort(b+1,b+m+1,cmp);
t=1;
for(int i=1;i<=m;i++){
while(a[t].x<=b[i].x && t<=n){
AddNew(a[t].k);
t++;
}
k=Lower(b[i].k,root);
if(k!=-INF){
Delete(k);
ans+=b[i].x;
}
}
if(root->siz || t<=n) printf("-1\n");
else printf("%lld\n",ans);
return 0;
}