Submission #1143165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143165		asdfghqwert	Art Exhibition (JOI18_art)	C++20	100 / 100	358 ms	12116 KiB

art

#include<bits/stdc++.h>
using namespace std;
typedef long long lli;
const int maxn = 5e5 + 8;
//you creepy basterd :)
pair<lli , lli > arr[maxn];
lli ans[maxn] , a;
int main(){
	int n ;cin >> n ;
	for(int i = 0 ; i < n ; i++)cin >> arr[i].first >> arr[i].second;
	sort(arr , arr + n );
	a = ans[0] = arr[0].second;
	for(int i = 1 ; i < n ; i++){ans[i] = max(ans[i-1] + arr[i].second + arr[i - 1].first - arr[i].first , arr[i].second);a = max(a  , ans[i]);}
	cout << a;
}

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