제출 #1274120

#제출 시각아이디문제언어결과실행 시간메모리
1274120almazArt Exhibition (JOI18_art)C++20
50 / 100
1093 ms8260 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; void solve(){ int n; cin >> n; vector <pair<int,int>> a(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)); for(int i = 0;i < n;i++){ int sum = 0; for(int j = i;j < n;j++){ sum += a[j].ss; ans = max(ans , sum - (a[j].ff - a[i].ff)); } } 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...