Submission #1520061

---

Source Code Expand

#include <queue>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <functional>

using namespace std;

typedef long long ll;

const int maxn = 110000;

struct rec
{
	int a, b;
};

priority_queue<int,vector<int>,greater<int> > q1, q2;
ll sy[maxn], sx[maxn];
rec a[maxn];

bool comp(const rec & a, const rec & b)
{
	return a.a - a.b < b.a - b.b;
}

int main(int argc, char * argv[])
{
	int x, y, z;
	ll ans = 0;
	scanf("%d%d%d", &x, &y, &z);
	for (int i = 1;i <= x + y + z;++i)
	{
		int t1, t2, t3;
		scanf("%d%d%d", &t1, &t2, &t3);
		ans += t3;
		a[i].a = t1 - t3;
		a[i].b = t2 - t3;
	}
	sort(a + 1, a + x + y + z + 1, comp);
	ll cur = 0;
	for (int i = 1;i <= y;++i)
	{
		cur += a[i].b;
		q1.push(a[i].b);
	}
	sy[y] = cur;
	for (int i = y + 1;i <= x + y + z;++i)
	{
		if (a[i].b > q1.top())
		{
			cur -= q1.top();
			q1.pop();
			cur += a[i].b;
			q1.push(a[i].b);
		}
		sy[i] = cur;
	}
	cur = 0;
	for (int i = x + y + z;i >= y + z + 1;--i)
	{
		cur += a[i].a;
		q2.push(a[i].a);
	}
	sx[y + z + 1] = cur;
	for (int i = y + z;i >= 1;--i)
	{
		if (a[i].a > q2.top())
		{
			cur -= q2.top();
			q2.pop();
			cur += a[i].a;
			q2.push(a[i].a);
		}
		sx[i] = cur;
	}
	ll ret = -(1ll<<60);
	for (int i = y;i <= y + z;++i)
	{
		ret = max(ret, sy[i] + sx[i+1]);
	}
	printf("%lld\n", ans+ret);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:32:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &x, &y, &z);
                             ^
./Main.cpp:36:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &t1, &t2, &t3);
                                 ^

Judge Result