# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832794 | manhtuan22007 | Art Exhibition (JOI18_art) | C++14 | 148 ms | 24776 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>
#define int long long
#define ll long long
using namespace std;
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
if(fopen(".inp" , "r")){
freopen(".inp" , "r" , stdin);
freopen(".out" , "w" , stdout);
}
int n;
cin >> n;
vector<pair<int , int>> a;
a.push_back({0 , 0});
for(int i = 1 ; i <= n ; i ++){
int x , y;
cin >> x >> y;
a.push_back({x , y});
}
sort(a.begin() , a.end());
vector<int> dp(n + 5);
dp[1] = a[1].second;
for(int i = 2 ; i <= n ; i ++){
dp[i] = max(dp[i - 1] + a[i].second - (a[i].first - a[i - 1].first) , a[i].second);
}
cout << *max_element(dp.begin() , dp.end());
}
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... |