# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1198236 | hitoru | Art Exhibition (JOI18_art) | C++20 | 111 ms | 12116 KiB |
#include <bits/stdc++.h>
using namespace std;
#define task "D"
#define ll long long
#define fi first
#define se second
const int maxn=5e5+5;
int n;
pair<ll,ll> a[maxn];
ll dp[maxn],ans=0;
int main()
{
if (fopen(task".INP","r"))
{
freopen(task".INP","r",stdin);
freopen(task".OUT","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>a[i].fi>>a[i].se;
}
sort(a+1,a+n+1);
for (int i=1;i<=n;i++)
{
dp[i]=max(dp[i-1]+a[i].se,a[i].se+a[i].fi);
}
for (int i=1;i<=n;i++) ans=max(ans,dp[i]-a[i].fi);
cout<<ans;
return 0;
}
컴파일 시 표준 에러 (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... |