Submission #157123

#	Time	Username	Problem	Language	Result	Execution time	Memory
157123		GioChkhaidze	Art Exhibition (JOI18_art)	C++14	50 / 100	1020 ms	24692 KiB

art

#include <bits/stdc++.h>
 
#define F first
#define S second
 
using namespace std;
 
const int N=500005;
 
long long n,ans,d[N];
pair < long long ,  long long > p[N];
 
int main() {
	cin>>n;
 
	for (int i=1; i<=n; i++) {
		cin>>p[i].F>>p[i].S;
	}
 
	sort(p+1,p+n+1);
 
	for (int i=1; i<=n; i++) {
		d[i]=max(d[i-1]+p[i].S+p[i-1].F-p[i].F,p[i].S);
		ans=max(ans,d[i]);
	}
 
	cout<<ans<<endl;
 
	return 0;
}

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