제출 #954340

#제출 시각아이디문제언어결과실행 시간메모리
954340hoanganh_siuuuuuuuuArt Exhibition (JOI18_art)C++17
50 / 100
1042 ms20720 KiB
#include <bits/stdc++.h> #define int long long #define f(i, a, b) for(int i = a; i <= b; i++) #define fr(i, a, b) for(int i = a; i >= b; i--) #define pii pair <int, int> #define fi first #define se second #define pb push_back #define eb emplace_back #define in insert #define vvec vector<vector<int>> #define fast ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0) using namespace std; const int N = 5e5 + 5; int n, k; pii a[N]; vector <int> z; void sub1() { int res = 0; f(i, 1, n) { int s = 0, mn = 1e17, mx = 0; f(j, i, n) { s += a[j].se; mn = min(mn, a[j].fi); mx = max(mx, a[j].fi); res = max(res, s - (mx - mn)); } } cout << res; } signed main() { fast; cin >> n; f(i, 1, n) cin >> a[i].fi >> a[i].se; sort(a + 1, a + n + 1); sub1(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...