제출 #1345097

#제출 시각아이디문제언어결과실행 시간메모리
1345097fatime_aslan_156Art Exhibition (JOI18_art)C++20
0 / 100
0 ms348 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
	ll n,c=0,s=0,l=0;
	cin>>n;
	vector<pair<ll,ll>>v(n);
	for(int i=0; i<n; i++)
	{
		cin>>v[i].first>>v[i].second;
	}
	sort(v.begin(),v.end());
	for(int i=0; i<n; i++)
	{
		c+=v[i].second;
		ll z=c-(v[i].first-v[l].first);
		s=max(s,z);
		while(l<i && c-v[l].second-(v[i].first-v[l+1].first)>=z)
		{
			s=max(s,c-v[l].second-(v[i].first-v[l+1].first));
			c-=v[l].second;
			l++;
			z=c-(v[i].first-v[l].first);
		}
	}
	cout<<s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...