제출 #1288262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288262		m.zeeshanrashid	Art Exhibition (JOI18_art)	C++20	100 / 100	124 ms	12252 KiB

art

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int n;
	cin>>n;
	vec<pii>a(n);
	for(int i=0;i<n;i++) cin>>a[i].fi>>a[i].se;
	sort(all(a));
	vec<int>dp(n);
	dp[0]=a[0].se;
	int ans=dp[0];
	for(int i=1;i<n;i++){
		dp[i]=max(0ll,dp[i-1]-(a[i].fi-a[i-1].fi))+a[i].se;
		ans=max(ans,dp[i]);
	}
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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