제출 #989074

#제출 시각아이디문제언어결과실행 시간메모리
989074Tsotne2019Art Exhibition (JOI18_art)C++17
100 / 100
163 ms24820 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n, dp[500001]; pair <ll, ll> p[500001]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i = 0; i < n; i++) { cin >> p[i].first >> p[i].second; } sort(p, p+n); dp[0] = p[0].second; for(int i = 1; i < n; i++) { dp[i] = max(p[i].second, dp[i-1] + p[i].second - p[i].first + p[i-1].first); } sort(dp, dp+n); cout << dp[n-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...