| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345126 | vjudge1 | Art Exhibition (JOI18_art) | C++20 | 301 ms | 12156 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,c=0,s=0,l=0;
cin>>n;
vector<pair<ll,ll>>v(n);
vector<ll>dp(n);
for(int i=0; i<n; i++)
{
cin>>v[i].first>>v[i].second;
}
sort(v.begin(),v.end());
dp[0]=v[0].second;
s=c;
for(int i=1; i<n; i++)
{
dp[i]=max(v[i].second,dp[i-1]+v[i].second-(v[i].first-v[i-1].first));
s=max(s,dp[i]);
}
cout<<s;
}
| # | 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... | ||||
