Sicily10359 (priority queue)

#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <

Queue> using namespace std; struct object {int w,v;}
A[300005];

int bag[300005];

BOOL Cmp1 (struct object A,struct object b) {return a.w<b.w;}
  	Class Cmp2 {Public:bool operator () (struct object A,struct object b) {return a.v<b.v;

}
};
    int main () {int n,m;
    int i,j;
    Priority_queue<struct object,vector<struct object>,cmp2> Q;
    scanf ("%d%d", &n,&m);

    for (i=0;i<n;i++) scanf ("%d%d", &AMP;A[I].W,&AMP;A[I].V);
      
    for (i=0;i<m;i++) scanf ("%d", &bag[i]);
    Sort (A,A+N,CMP1);
    
    Sort (bag,bag+m);
    int apos=0;
    Long Long ans=0;
    		for (i=0;i<m;i++) {while (Apos<n && a[apos].w<=bag[i]) {Q.push (A[apos]);
    	apos++; } if (!
	    	Q.empty ()) {ans+=q.top (). V;
      Q.pop ();
}} printf ("%lld\n", ans);  }