# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45664 | reality | Art Exhibition (JOI18_art) | C++17 | 958 ms | 244224 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
scanf("%d",&n);
map < ll , ll > M;
for (int i = 0;i < n;++i) {
ll u,v;
scanf("%lld%lld",&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 = 0;
for (int i = 1;i < n;++i) {
if (i > 0)
smin(mn,s[i - 1].se - s[i].fi);
smax(ans,s[i].se - s[i].fi - mn);
}
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |