Submission #1266704

#TimeUsernameProblemLanguageResultExecution timeMemory
1266704cmiucArt Exhibition (JOI18_art)C++20
100 / 100
327 ms8764 KiB
#include <iostream> #include <queue> #include <algorithm> using namespace std; #define int long long signed main(){ int n; cin>>n; vector<pair<int,int>> vec = {{0, 0}}; for (int i=1, A, B;i<=n;i++){ cin>>A>>B; vec.push_back({A, B}); } sort(begin(vec), end(vec)); int sum = 0, Mx = -1e17, Ans = 0; for (auto [A, B] : vec){ Mx = max(Mx, -sum + A); sum += B; Ans = max(Ans, sum - A + Mx); } cout<<Ans<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...