제출 #98734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98734		janchomath	Art Exhibition (JOI18_art)	C++14	100 / 100	746 ms	24952 KiB

art

#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mxn 500005
using namespace std;
ll n,dp[mxn],ans;
pair<ll,ll>a[mxn];
int main(){
	cin >> n;
	
	for(int i=1; i<=n; i++){
		cin >> a[i].f >> a[i].s;
	}
	
	sort(a+1,a+n+1);
	
	for(int i=1; i<=n; i++){
		dp[i] = max(dp[i-1] + a[i-1].f - a[i].f + a[i].s,a[i].s);
		//cout << dp[i] << " ";
		ans = max(ans,dp[i]);
	}
	
	
	cout << ans;
	
	
	
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50