# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003652 | jamjanek | Bulldozer (JOI17_bulldozer) | C++14 | 1 ms | 600 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>
using namespace std;
int main(){
int n, i, a, b, c;
scanf("%d", &n);
vector<pair<int,int>>tab;
for(i=0;i<n;i++){
scanf("%d%d%d", &a, &b, &c);
tab.push_back({a,c});
}
long long suma=0, sumap=0, res=0;
sort(tab.begin(), tab.end());
for(auto j: tab){
suma+=j.second;
sumap = min(sumap, suma);
res = max(res, suma-sumap);
}
printf("%lld\n", res);
}
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... |