Submission #486879

#	Time	Username	Problem	Language	Result	Execution time	Memory
486879		PoPularPlusPlus	Art Exhibition (JOI18_art)	C++17	100 / 100	188 ms	12284 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	vector<pair<ll,ll>> v;
	for(int i = 0; i < n; i++){
		ll a , b;
		cin >> a >> b;
		v.pb(mp(a,b));
	}
	sv(v);
	ll dp[n];
	dp[n-1] = v[n-1].vs;
	ll ans = dp[n-1];
	for(int i = n-2; i >= 0; i--){
		dp[i] = v[i].vs + max(0LL , dp[i + 1] - (v[i + 1].vf - v[i].vf));
		ans = max(ans, dp[i]);
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

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