全紫求助
查看原帖
全紫求助
351249
qige_mingzi楼主2020/9/9 22:15
#include<iostream>
using namespace std;
long long n;
long long x,y,z;
long long b[250001][2]; 
long long sum;
long long head,tail;
int main()
{
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> x >> y >> z;
		while(z-b[tail][1] > 45){
			tail++;
		}
		if(x == 0){
			sum = sum+y;
			head++;
			b[head][0] = y;
			b[head][1] = z;
		}
		if(x == 1){
			bool t = true;
			for(int j = tail;j <= head;j++){
				if(b[j][0] >= y){
					t = false;
					b[j][0] = 1000000001;
					b[j][1] = -1000000001;
					break;
				}
			}
			if(t == true){
				sum = sum+y;
			}
		}
	}
	cout << sum;
	//for(int i = 1;i <= n;i++){
//		`
//	}
    return 0;
}

2020/9/9 22:15
加载中...