제출 #988799

#제출 시각아이디문제언어결과실행 시간메모리
988799MuhammetArt Exhibition (JOI18_art)C++17
50 / 100
1053 ms21332 KiB
#include <bits/stdc++.h> using namespace std; #define N 500005 #define ll long long int #define sz(x) (int)x.size() #define ff first #define ss second ll T, n, f[N], mx[N]; pair <ll,ll> a[N]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i].ff >> a[i].ss; } sort(a+1,a+n+1); ll ans = 0; for(int i = 1; i <= n; i++){ ll s = 0; for(int j = i; j <= n; j++){ s += a[j].ss; ans = max(ans,(s - (a[j].ff - a[i].ff))); } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...