Submission #994195

#TimeUsernameProblemLanguageResultExecution timeMemory
994195irmuunBulldozer (JOI17_bulldozer)C++17
5 / 100
1 ms600 KiB
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    array<ll,3>a[n+5];
    for(ll i=1;i<=n;i++){
        cin>>a[i][0]>>a[i][1]>>a[i][2];
    }
    sort(a+1,a+n+1);
    ll pre[n+5];
    pre[0]=0;
    for(ll i=1;i<=n;i++){
        pre[i]=pre[i-1]+a[i][2];
    }
    ll ans=0;
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=i;j++){
            ans=max(ans,pre[i]-pre[j-1]);
        }
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...