Submission #1693871

---

Source Code Expand

#include <cstdio>
#include <algorithm>
int N, X, Y, Z;
long long O;
std::pair < long long, long long > p[100001], q[100001];
std::pair < long long, std::pair < int, int > > check(long long mid)
{
	int i = 1, j = 1, gi = 0, gj = 0;
	long long s = 0;
	while (gi + gj < X + Y)
	{
		while (i <= N && p[i].first + mid < p[i].second)
			i++;
		if (i > N)
			break;
		while (j <= N && q[j].first + mid >= q[j].second)
			j++;
		if (j > N)
			break;
		if (p[i].first + mid >= q[j].second)
		{
			gi++;
			s += p[i++].first;
		}
		else
		{
			gj++;
			s += q[j++].second;
		}
	}
	while (gi + gj < X + Y)
	{
		while (i <= N && p[i].first + mid < p[i].second)
			i++;
		if (i > N)
			break;
		gi++;
		s += p[i++].first;
	}
	while (gi + gj < X + Y)
	{
		while (j <= N && q[j].first + mid >= q[j].second)
			j++;
		if (j > N)
			break;
		gj++;
		s += q[j++].second;
	}
	i = 1, j = 1;
	int Gi = 0, Gj = 0;
	long long S = 0;
	while (Gi + Gj < X + Y)
	{
		while (i <= N && p[i].first + mid <= p[i].second)
			i++;
		if (i > N)
			break;
		while (j <= N && q[j].first + mid > q[j].second)
			j++;
		if (j > N)
			break;
		if (p[i].first + mid > q[j].second)
		{
			Gi++;
			S += p[i++].first;
		}
		else
		{
			Gj++;
			S += q[j++].second;
		}
	}
	while (Gi + Gj < X + Y)
	{
		while (i <= N && p[i].first + mid <= p[i].second)
			i++;
		if (i > N)
			break;
		Gi++;
		S += p[i++].first;
	}
	while (Gi + Gj < X + Y)
	{
		while (j <= N && q[j].first + mid > q[j].second)
			j++;
		if (j > N)
			break;
		Gj++;
		S += q[j++].second;
	}
	return { S - mid * (X - Gi), { Gi, gi } };
}
int main()
{
	scanf("%d%d%d", &X, &Y, &Z);
	N = X + Y + Z;
	for (int i = 1; i <= N; i++)
	{
		long long a, b, c;
		scanf("%lld%lld%lld", &a, &b, &c);
		O += c;
		p[i] = q[i] = std::make_pair(a - c, b - c);
	}
	std::sort(p + 1, p + N + 1, [] (const auto &i, const auto &j) { return i.first > j.first; });
	std::sort(q + 1, q + N + 1, [] (const auto &i, const auto &j) { return i.second > j.second; });
	long long l = -1000000000, r = 1000000000;
	while (l < r)
	{
		long long m = l + r >> 1;
		std::pair < long long, std::pair < int, int > > ans = check(m);
		if (ans.second.first <= X && X <= ans.second.second)
		{
			printf("%lld\n", O + ans.first);
			return 0;
		}
		if (ans.second.second < X)
			l = m + 1;
		else
			r = m - 1;
	}
	while (1);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:95: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:100:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &a, &b, &c);
                                    ^

Judge Result