제출 #272120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
272120		erkam	Art Exhibition (JOI18_art)	C++17	100 / 100	205 ms	8572 KiB

art

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<utility>
#include<vector>
#include<stack>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#define endl "\n"
#define all(v) v.begin(),v.end()
#define st first
#define nd second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long lo;
const int mod=1000000007,N=500005;
lo a,b,c,d,e,f,g=1,h[N];
pair<lo,lo> arr[N];
string s;
vector<lo>v;

int main(){
	#ifdef local
		freopen("in.txt","r",stdin);
		freopen("out.txt","w",stdout);
	#endif
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	cin >> a;
	lo ans=0;
	for(lo i=1;i<=a;i++){
		cin >> arr[i].st >> arr[i].nd;
	}
	sort(arr+1,arr+a+1);
	lo sum=arr[1].nd;
	for(lo i=2;i<=a;i++){
		if(sum<=arr[i].st-arr[i-1].st) sum=arr[i].nd;
		else sum+=arr[i].nd-(arr[i].st-arr[i-1].st);
		ans=max(ans,sum);
	}
	cout << ans << endl;
}

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