제출 #1050890

#제출 시각아이디문제언어결과실행 시간메모리
1050890inkvizytorArt Exhibition (JOI18_art)C++17
100 / 100
120 ms24992 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fi first 
#define se second

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<ll, ll>> a (n); 
    vector<ll> dp (n, 0);
    for (int i = 0; i < n; i++) {
        cin >> a[i].fi >> a[i].se;
    }
    sort(a.begin(), a.end());
    dp[0] = a[0].se;
    ll v = dp[0];
    for (int i = 1; i < n; i++) {
        dp[i] = max(a[i].se, dp[i-1]+a[i].se-a[i].fi+a[i-1].fi);
        v = max(v, dp[i]);
    }
    cout << v << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...