- 公交换乘
公交换乘
- @ 2024-8-1 18:41:28
#include<bits/stdc++.h>
#include<cstring>
using namespace std;
int t[100000]={0};
int p[100000]={0};
int main(){
int c=0,n,w,ice,ti,k=0,k1=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>w;
cin>>ice;
cin>>ti;
for(int j=k1;j<k;j++,k1++){
if(t[j]>=ti) break;
}
if(w==0){
t[k]=ti+45;
p[k]=ice;
k++;
}
else{
for(int j=k1;j<=k;j++){
if(ice<=p[j]){
t[j]=0;
p[j]=0;
ice=0;
break;
}
}
}
c=c+ice;
}
cout<<c<<endl;
return 0;
}
0 comments
No comments so far...
Information
- ID
- 52
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 73
- Accepted
- 30
- Uploaded By