满江红求助,答者必关
查看原帖
满江红求助,答者必关
1273263
chenhouye楼主2025/8/30 14:45
#include<bits/stdc++.h>
using namespace std;
struct node{
	int t,x;
};
int n,op,ans;
bool flag;
vector<node>v;
vector<node>::iterator it;
int main(){
	scanf("%d",&n);
	while(n--){
		scanf("%d",&op);
		if(op==0){
			node f;
			scanf("%d%d",&f.x,&f.t);
			ans+=f.x;
			v.push_back(f);
		}
		else{
			int tt,xx;
			scanf("%d%d",&xx,&tt);
			flag=0;
			for(it=v.begin();it<v.end();it++){
				node g=*it;
				if(tt-g.t>45){
					v.erase(it);
					continue;
				}
				if(xx<=g.x){
					v.erase(it);
					flag=1;
					break;
				}
			}		
			if(flag==0) ans+=xx;
		}
	}
	printf("%d",ans);
	return 0;
}

恳求大佬帮助,全WA了!

2025/8/30 14:45
加载中...