#include <bits/stdc++.h>
using namespace std;
#define int long long
void doWork(){
int n , d;
cin >> n >> d;
vector<array<int , 3>> v;
vector<int> B(1 , 1e18);
for (int i = 1 ; i <= n ; i++){
int x , a , b;
cin >> x >> a >> b;
v.push_back({x , b , -a});
B.push_back(b);
}
sort(v.begin() , v.end());
sort(B.begin() , B.end());
int x[n+1] = {} , a[n+1] = {} , b[n+1] = {};
for (int i = 1 ; i <= n ; i++){
x[i] = v[i-1][0];
a[i] = v[i-1][2];
b[i] = v[i-1][1];
}
int ans = 1e18;
for (int i = 0 ; i <= n ; i++){
// cout << B[i] << '\n' << '\n';
int mn = 0 , sum = 0;
for (int j = 1 ; j <= n ; j++){
// cout << mn << ' ' << sum << '\n';
mn = min(mn , -x[j] + sum);
if (b[j] <= B[i]) sum -= a[j];
}
//cout << '\n';
if (-mn <= B[i]) ans = -mn;
}
cout << ans;
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
doWork();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3049 ms |
26356 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |