제출 #868051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868051		MongHwa	Art Exhibition (JOI18_art)	C++17	100 / 100	145 ms	20960 KiB

art

#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define X first
#define Y second

pair<ll, ll> arr[500001];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    cin >> n;

    for(int i = 0; i < n; i++)
        cin >> arr[i].X >> arr[i].Y;

    sort(arr, arr+n);

    ll ans = 0;
    ll cur = 0;
    for(int i = 0; i < n; i++)
        ans = max(ans, arr[i].Y);
        
    for(int i = 0; i < n; i++)
    {
        if(ans < cur+arr[i].Y - arr[i].X)
            ans = cur+arr[i].Y - arr[i].X;

        if(cur < arr[i].X)
            cur = arr[i].X;
        cur += arr[i].Y;
    }

    cout << ans << '\n';
}

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