Submission #7928243

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<ctype.h>
#include<set>
#include<queue>
#define int long long
using namespace std;
inline int read(){
    int x=0,f=0;char ch=getchar();
    while(!isdigit(ch))f|=ch=='-',ch=getchar();
    while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
    return f?-x:x;
}
typedef pair<int,int> pairs;
priority_queue<int> q;
multiset<pairs> v;
signed main(){
    int n=read(),sum=0,ans=0;read();
    while(n--){
        int t=read(),p=read();
        v.insert(make_pair(-t,p));
        sum+=p;
    }
    for(multiset<pairs>::iterator it=v.begin();it!=v.end();it++){
        q.push(-(*it).second),q.push(-(*it).second);
        ans+=q.top(),q.pop();
    }
    printf("%lld\n",ans+sum);
    return 0;
}

Submission Info

Judge Result