求助
查看原帖
求助
836960
tanceyu楼主2024/7/19 19:08
#include<iostream>
using namespace std;
const int MAXN = 100005;
int main(){
	int n;
	cin>>n;
	struct quan{
		int time;
		int price;
		int used;
	}q[MAXN];
	int bors;
	int ans=0;
	int mini=0;
	
	for(int i=0;i<n;i++){
		cin>>bors>>q[i].price>>q[i].time;
		if(i>45){
			mini=45-i;
		}
		if(bors==0){
			ans+=q[i].price;
			q[i].used=1;
		}else{
			for(int u=mini;u<i;u++){
				if(q[i].time-q[u].time<45&&q[u].used==1&&q[u].price<q[i].price){
					q[u].used=0;
				}else{
					ans+=q[i].price;
				}
			}	
		}
	} 
	cout<<ans;
	
	return 0;
}
2024/7/19 19:08
加载中...