제출 #541360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
541360		LittleOrange	Bulldozer (JOI17_bulldozer)	C++17	0 / 100	1 ms	324 KiB

bulldozer

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    ios::sync_with_stdio(0);cin.tie();
    int n;
    cin >> n;
    vector<pair<ll,ll>> a(n);
    vector<pair<ll,ll>> b(n);
    for (int i = 0;i<n;i++){
        ll x,y,w;
        cin >> x >> y >> w;
        a[i] = {x,w};
        b[i] = {y,w};
    }
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    vector<ll> sum(n+1);
    sum[0] = 0;
    for (int i = 0;i<n;i++){
        sum[i+1] = sum[i]+a[i].second;
    }
    ll m = 0;
    ll ans = 0;
    for (int i = 1;i<=n;i++){
        ans = max(ans,sum[i]-m);
        m = min(m,sum[i]);
    }
    sum[0] = 0;
    for (int i = 0;i<n;i++){
        sum[i+1] = sum[i]+b[i].second;
    }
    m = 0;
    for (int i = 1;i<=n;i++){
        ans = max(ans,sum[i]-m);
        m = min(m,sum[i]);
    }
    cout << ans << "\n";
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 35
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20