제출 #1236369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236369		nasjes	Art Exhibition (JOI18_art)	C++20	100 / 100	634 ms	8400 KiB

art

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll dim = 5*1e6+7;
//const ll mod = 1e9 + 7;
const ll inf = 1e18 + 77;
#define endl "\n"
#define fi first
#define pb push_back
#define se second
#define vll vector<ll>

ll n, m;
pll a[dim];
ll pr[dim];

int main() {
    ll k;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i].fi>>a[i].se;
    }
    sort(a+1, a+1+n);
    ll ans=0;
    ll y=0;
    ll curs=0;
    for(int i=1; i<=n; i++){
        y=max(a[i].fi-curs,y );
        curs+=a[i].se;
       ll val=curs-a[i].fi+y;
        ans=max(ans, val);
    }
    cout<<ans<<endl;


    return 0;
}

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