Submission #1220010

#TimeUsernameProblemLanguageResultExecution timeMemory
1220010akqxolotlArt Exhibition (JOI18_art)C++20
100 / 100
317 ms12148 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pii;
#define fi first
#define se second

signed main(){
	int n;cin>>n;
	pii a[n+1];
	for(int i=1;i<=n;i++)cin>>a[i].fi>>a[i].se;
	int dp[n+1];
	dp[0]=0;
	int ans=0;
	sort(a,a+n+1);
	a[0]=a[1];
	for(int i=1;i<=n;i++){
		dp[i]=max(a[i].se,dp[i-1]+a[i].se-(a[i].fi-a[i-1].fi));
		ans=max(ans,dp[i]);
	}
	cout<<ans<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...