# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77287 | MohamedAhmed0 | Art Exhibition (JOI18_art) | C++14 | 1075 ms | 36928 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;
long long dp[500001] ;
int main()
{
long long n ;
cin>>n ;
map<long long , long long>mp ;
for(long long i = 0 ; i < n ; ++i)
{
long long x , y ;
cin>>x>>y;
mp[x] += y ;
}
vector< pair<long long , long long> >vp ;
for(auto &i : mp)
vp.push_back({i.first , i.second});
long long ans = vp[0].second;
dp[0] = vp[0].second;
for(long long i = 1 ; i < vp.size() ; ++i)
{
dp[i] = max(vp[i].second , vp[i].second + dp[i-1] - (vp[i].first - vp[i-1].first));
ans = max(ans , dp[i]);
}
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... |