Submission #1049813

#TimeUsernameProblemLanguageResultExecution timeMemory
1049813vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
323 ms20048 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n;
    cin >> n;
    pair<int,int> a[n*2];
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    sort(a+1,a + n + 1);
    vector<int> dp(n + 1);
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        dp[i] = max(dp[i - 1] + a[i].second, a[i].first + a[i].second);
        ans = max(ans, dp[i] - a[i].first);
    }
    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...