Submission #1266951

#TimeUsernameProblemLanguageResultExecution timeMemory
1266951michael12Art Exhibition (JOI18_art)C++20
30 / 100
3 ms580 KiB
#include<bits/stdc++.h> #define ff first #define ss second #define pb push_back #define mp make_pair using namespace std; typedef pair<long long, long long> pii; int main(){ // long long n,m; // long long dx[4] = {0, 0, -1, 1}; // long long dy[4] = {1, -1, 0, 0}; // cin >> n; // vector<long long> a(n); // for(long long i = 0; i < n; i++){ // cin >> a[i]; // } // sort(a.begin(), a.end()); // set<long long> st; // vector<long long> nn; // for(long long i = 0; i < n - 2; i++){ // for(long long j = i + 1; j < n - 1; j++){ // nn.push_back(a[i] + a[j]); // } // } // long long ans = 0; // for(long long i = 0; i < nn.size(); i++){ // auto it = upper_bound(a.begin(), a.end(), nn[i]) - a.begin(); // if(it < n){ // ans += n - it; // } // } // cout << ans; long long n; cin >> n; pair<long long, long long> a[2 * n]; for(long long i = 0; i < n; i++){ cin >> a[i].ff >> a[i].ss; } sort(a, a + n); long long dp[1000]; dp[0] = a[0].ss; for(long long i = 1; i < n; i++){ dp[i] = max(a[i].ss, dp[i - 1] + a[i - 1].ff + a[i].ss - a[i].ff); } long long ans = 0; for(long long i = 0; i < n; i++){ ans = max(ans, dp[i]); } 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...