记录编号	452216	评测结果	AAAAAAAAAA
题目名称	天天寄快递	最终得分	100
用户昵称	皓芷	是否通过	通过
代码语言	C++	运行时间	0.041 s
提交时间	2017-09-19 06:55:23	内存使用	4.13 MiB

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#define mysister
using namespace std;
const int maxn=200001;
struct mmp
{
	int e;
	long long t;
	mmp(int a,long long b){e=a;t=b;}
	bool operator < (mmp b)const
	{
		return t<b.t;
	}
};
bool cmp(mmp a,mmp b)
{
	return a.t>b.t;
}
void in(int &x)
{
	x=0;int f=1;char c=getchar();
	while(c<'0'||'9'<c){if(c=='-')f=-1;c=getchar();}
	while('0'<=c&&c<='9'){x=(x<<3)+(x<<1)+(c^'0');c=getchar();}
	x*=f;
}
void in(long long &x)
{
	x=0;long long f=1;char c=getchar();
	while(c<'0'||'9'<c){if(c=='-')f=-1;c=getchar();}
	while('0'<=c&&c<='9'){x=(x<<3)+(x<<1)+(c^'0');c=getchar();}
	x*=f;
}
int n,e,head[maxn],m,s,sz[maxn];
long long t,now=0,k,ans=0;
vector<mmp>v[maxn];
priority_queue<mmp>q;
int main()
{
	freopen("expresss.in","r",stdin);
	freopen("expresss.out","w",stdout);
	in(n);in(m);in(s);in(k);
	for(int i=0;i<m;i++)
	{
	  in(e);in(t);
	  if(t-2ll>0)v[e].push_back(mmp(e,t-2));
	}
	for(int i=1;i<=n;i++)if(s>0)
	{
	  sort(v[i].begin(),v[i].end(),cmp);sz[i]=v[i].size();
	  now=0;
	  while(now<k&&s>0&&head[i]<sz[i])
	  {
	  	now+=v[i][head[i]++].t;
	  	s--;
	  }
	  if(now<k)break;
	  ans+=now;
	  if(head[i]<sz[i])q.push(v[i][head[i]++]);
	}
	if(now<k||now<0)
	{
	  printf("-23333333");
	}
	else 
	{
	  while(s>0&&(!q.empty()))
	  {
	  	ans+=q.top().t;
	  	if(head[q.top().e]<sz[q.top().e])q.push(v[q.top().e][head[q.top().e]++]);
	  	q.pop();
	  	s--;
	  }
	  printf("%lld",ans);
	}
	return 0;
}