Submission #1693361

---

Source Code Expand

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
inline char tc(void){
	static char fl[10000],*A=fl,*B=fl;
	return A==B&&(B=(A=fl)+fread(fl,1,10000,stdin),A==B)?EOF:*A++;
}
inline int read(void){
	int a=0;static char c;
	while((c=tc())<'0'||c>'9');
	while(c>='0'&&c<='9')a=a*10+c-'0',c=tc();
	return a;
}
struct Y{
	int a,b,p;
	bool operator <(const Y&a)const{
		return p>a.p;
	}
}k[100005];
int x,y,z,n,sum;
long long ans=-1e18,ans1,ans2,c;
char b[100005];
priority_queue<int,vector<int>,greater<int> >sum2;
priority_queue<pair<int,int>,vector<pair<int,int> >,less<pair<int,int> > >sum1;
int main(void){
	register int i,wjnsb;
	x=read(),y=read(),z=read(),n=x+y+z;
	for(i=1;i<=n;++i){
		k[i].a=read(),k[i].b=read(),wjnsb=read(),k[i].a-=wjnsb,k[i].b-=wjnsb,
		k[i].p=k[i].a-k[i].b,c+=wjnsb;
	}
	sort(k+1,k+n+1);
	for(i=1;i<=x;++i)
		sum2.push(k[i].a),ans1+=k[i].a;
	for(i=x+1;i<=n;++i)
		sum1.push(make_pair(k[i].b,i));
	for(i=1;i<=y;++i)
		b[sum1.top().second]=1,ans2+=sum1.top().first,sum1.pop();
	n-=y;
	ans=max(ans1+ans2,ans);
	for(i=x+1;i<=n;++i){
		sum2.push(k[i].a),ans1+=k[i].a,ans1-=sum2.top(),sum2.pop();
		if(b[i]==1){
			ans2-=k[i].b;
			while(b[sum1.top().second])
				sum1.pop();
			b[sum1.top().second]=1,ans2+=sum1.top().first,sum1.pop();
		}
		b[i]=1,ans=max(ans1+ans2,ans);
	}
	printf("%lld",ans+c);
	return 0;
}

Submission Info

Judge Result