Submission #1274118

#TimeUsernameProblemLanguageResultExecution timeMemory
1274118almazArt Exhibition (JOI18_art)C++20
10 / 100
1095 ms724 KiB
#include <bits/stdc++.h> using namespace std; #define int long long // #define endl '\n' #define ff first #define ss second #define pb push_back #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ar array const int MOD = 1e9 + 7,INF = 1e18, N = 2e5 + 5; /* */ int ans = 0; vector <pair<int,int>> a; void rec(int l,int r, int sum){ int mn = a[l].ff, mx = a[r].ff; ans = max(ans, sum - (mx - mn)); if(l != r){ rec(l + 1,r , sum - a[l].ss); rec(l , r - 1 , sum - a[r].ss); } } void solve(){ int n; cin >> n; a.resize(n); int sum = 0; for(int i = 0;i < n;i++){ cin >> a[i].ff >> a[i].ss; sum += a[i].ss; } sort(all(a)); rec(0 , n - 1, sum); cout<<ans<<endl; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int ti = 1; while (ti--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...