Submission #45662

#TimeUsernameProblemLanguageResultExecution timeMemory
45662realityArt Exhibition (JOI18_art)C++17
0 / 100
2 ms248 KiB
#include "bits/stdc++.h" using namespace std; #define fi first #define se second #define ll long long #define dbg(v) cerr<<#v<<" = "<<v<<'\n' #define vi vector<int> #define vl vector <ll> #define pii pair<int,int> #define mp make_pair #define db long double #define pb push_back #define all(s) s.begin(),s.end() template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;} template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;} int main(void) { int n; cin>>n; map < ll , ll > M; for (int i = 0;i < n;++i) { ll u,v; cin>>u>>v; M[u] += v; } vector < pair < ll , ll > > s; for (auto it : M) s.pb(it); n = s.size(); vl ss; for (int i = 1;i < n;++i) s[i].se += s[i - 1].se; ll mn = -s[0].fi; ll ans = -1e18; for (int i = 1;i < n;++i) { smax(ans,s[i].se - s[i].fi - mn); smin(mn,s[i - 1].se - s[i].fi); } 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...