Submission #6918307

---

Source Code Expand

#include<bits/stdc++.h>
#define il inline
#define vd void
typedef long long ll;
il ll gi(){
	ll x=0,f=1;
	char ch=getchar();
	while(!isdigit(ch))f^=ch=='-',ch=getchar();
	while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
	return f?x:-x;
}
struct cxk{int a,b,c;}s[100010];
ll L[100010],R[100010];
std::priority_queue<int,std::vector<int>,std::greater<int>>que;
int main(){
#ifdef XZZSB
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	int X=gi(),Y=gi(),Z=gi(),_a,_b,_c,n=X+Y+Z;
	ll sumc=0;
	for(int i=1;i<=n;++i)_a=gi(),_b=gi(),_c=gi(),s[i]={_a-_c,_b-_c,_b-_a},sumc+=_c;
	std::sort(s+1,s+n+1,[](cxk a,cxk b){return a.c<b.c;});
	for(int i=1;i<=n;++i){
		L[i]=L[i-1]+s[i].a;que.push(s[i].a);
		if(i>X)L[i]-=que.top(),que.pop();
	}
	while(!que.empty())que.pop();
	for(int i=n;i;--i){
		R[i]=R[i+1]+s[i].b;que.push(s[i].b);
		if(n-i+1>Y)R[i]-=que.top(),que.pop();
	}
	ll ans=-9e18;
	for(int i=X;i<=n-Y;++i)ans=std::max(ans,L[i]+R[i+1]);
	printf("%lld\n",ans+sumc);
	return 0;
}

Submission Info

Judge Result