考场猎奇代码AC

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int maxn = 1e6+5;
using pii = pair<int, int>;
struct node {
	int x, y;
} candies[maxn];
int n, m, minsum = INT_MAX, res, minid, bought[maxn], flag;
priority_queue<int, vector<int>, greater<int>> q;
void solve1() {
	sort(candies + 1, candies + n + 1, [](node a, node b) {
		return a.x + a.y == b.x + b.y ? a.x > b.x : a.x + a.y < b.x + b.y;
	});
	minsum = candies[1].x + candies[1].y;
	sort(candies + 2, candies + n + 1, [](node a, node b) {
		return a.x < b.x;
	});
	for (int i = 2; i <= n; i++) {
		if (candies[i].x <= minsum / 2) {
			res++;
			m -= candies[i].x;
			bought[i] = 1;
		}
	}
	res += m / minsum * 2;
	m %= minsum;
	for (int i = 1; i <= n; i++) {
		if (bought[i])q.push(candies[i].y);
		else q.push(candies[i].x);
	}
	while (q.size()) {
		if (m >= q.top()) m -= q.top(), res++, q.pop();
		else q.pop();
	}
	cout << res;
}
void solve2() {
	sort(candies + 1, candies + n + 1, [](node a, node b) {
		return a.x + a.y == b.x + b.y ? a.x > b.x : a.x + a.y < b.x + b.y;
	});
	minsum = candies[1].x + candies[1].y;
	sort(candies + 1, candies + n + 1, [](node a, node b) {
		return a.x < b.x;
	});
	res += (m / minsum) * 2;
	m %= minsum;
	for (int i = 1; i <= n; i++) if (m >= candies[i].x) m -= candies[i].x, res++;
	cout << res;
}
signed main() {
	freopen("candy.in","r",stdin);
	freopen("candy.out","w",stdout);
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> candies[i].x >> candies[i].y;
		if (candies[i].x < candies[i].y) flag = 1;
	}
	if (flag) solve1();
	else solve2();
	return 0;
}