tyvj4867 天天寄快遞

​​http://www.elijahqi.win/archives/893​​

#include<cstdio>
#include<queue>
#include<algorithm>
#define N 220000
using namespace std;
priority_queue<int> q; 
priority_queue<int> q1[N];
inline int read(){
    int x=0;char ch=getchar();
    while (ch<'0'||ch>'9') ch=getchar();
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
    return x;
}
struct node{
    int e,t;
}data[N];
int n,m,s,k,need[N],need1[N];
int main(){
    freopen("express.in","r",stdin);
    n=read();m=read();s=read();k=read();
    for (int i=1;i<=m;++i){
        int e=read(),t=read();
        q1[e].push(t-2);if (t-2>0) need[e]++,need1[e]+=t-2;
    }long long ans=0;long long tmp;int cnt=0;
    for (int i=1;i<=n;++i){
        tmp=0;if (need1[i]<k){printf("-23333333");return 0;}
        while (q1[i].size()&&q1[i].top()>0&&++cnt<=s){
            tmp+=q1[i].top();ans+=q1[i].top();q1[i].pop();if (tmp>=k) break;
        }
        while (q1[i].size()&&q1[i].top()>0){
            q.push(q1[i].top());q1[i].pop();
        }
        if (tmp<k) {printf("-23333333");return 0;}
    }
    while(q.size()&&q.top()>0&&++cnt<=s){
        ans+=q.top();q.pop();
    }
    printf("%lld",ans);
    return 0;
}