# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135336 | Just_Solve_The_Problem | Bulldozer (JOI17_bulldozer) | C++11 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = (int)2e3 + 7;
int a[N];
int x[N], y[N], w[N], pos[N];
int n;
ll pref[N];
main() {
scanf("%d", &n);
iota(pos, pos + n, 0);
for (int i = 0; i < n; i++) {
scanf("%d %d %d", &x[i], &y[i], &w[i]);
}
sort(pos, pos + n, [&](const int &A, const int &B){
return x[A] < x[B];
});
ll mn = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (i) pref[i] = pref[i - 1];
pref[i] += w[pos[i]];
ans = max((pref[i] - mn), ans);
mn = min(mn, pref[i]);
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |