TLE了11个点,求助
查看原帖
TLE了11个点,求助
451795
蒟蒻的韩某楼主2022/7/1 14:26
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, fl, flag, ans;

struct piao {
	int x;
	int y;
} p[100005];

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d%d%d", &a, &b, &c);
		if (a == 0) {
			p[fl].x = b;
			p[fl].y = c;
			fl++;
			ans += b;
		} else {
			flag = 0;
			for (int i = 0; i < fl; i++) {
				if (c - p[i].y <= 45 && b <= p[i].x) {
					p[i].x = -1;
					flag = 1;
					break;
				}
			}
			if (!flag)
				ans += b;
		}
	}
	printf("%d", ans);
	return 0;
}
2022/7/1 14:26
加载中...