Submission #1189196

#TimeUsernameProblemLanguageResultExecution timeMemory
1189196temptemptempArt Exhibition (JOI18_art)C++20
100 / 100
139 ms8264 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int , int> #define pb push_back #define F first #define S second const int mod = 1e9 + 7; const int N = 1e5 + 5; void solve() { int n; cin >> n; vector<pii> v(n); for(auto& i : v) cin >> i.F >> i.S; sort(v.begin() , v.end()); int x = 0 , s = 0 , ans = 0; for(auto i : v){ x = min(x , s - i.F); s += i.S; ans = max(ans , s - i.F - x); } cout << ans << '\n'; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int T = 1; //cin >> T; while(T--) 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...