Submission #1101795

#TimeUsernameProblemLanguageResultExecution timeMemory
1101795SulAArt Exhibition (JOI18_art)C++17
100 / 100
140 ms8440 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define bitcount __builtin_popcountll using namespace std; using namespace __gnu_pbds; using namespace chrono; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n; cin >> n; #define cost first #define value second pair<long long,long long> a[n]; for (int i = 0; i < n; cin >> a[i].cost >> a[i++].value); sort(a, a + n); // p[i] - a[i] + a[j] - p[j-1] long long sum = 0, pref = 0, ans = 0; for (int i = 0; i < n; i++) { pref = max(pref, a[i].cost - sum); sum += a[i].value; ans = max(ans, sum - a[i].cost + pref); // ans = max(ans, a[i].value); } cout << ans; }

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:17:51: warning: operation on 'i' may be undefined [-Wsequence-point]
   17 |     for (int i = 0; i < n; cin >> a[i].cost >> a[i++].value);
      |                                                  ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...