Submission #1071262

#TimeUsernameProblemLanguageResultExecution timeMemory
1071262vjudge1Art Exhibition (JOI18_art)C++17
50 / 100
1031 ms8032 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define sz(x) x.size() #define nl '\n' #define F first #define S second const int N = 1e6 + 1; const int inf = 1e18; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >>n; pair<int, int>a[n + 1]; for( int i = 1; i <= n; ++i ) cin >>a[i].F >>a[i].S; sort(a + 1, a + n + 1); int ans = 0; for( int l = 1; l <= n; ++l ) { int mn = inf, mx = 0, sum = 0; for( int r = l; r <= n; ++r ) { mn = min(mn, a[r].F); mx = max(mx, a[r].F); sum += a[r].S; ans = max(ans, sum - mx + mn); } } 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...