제출 #1124501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124501		LucaIlie	Art Exhibition (JOI18_art)	C++20	100 / 100	460 ms	8240 KiB

art

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5e5;
const long long INF = 1e18;

struct art {
    long long size;
    int value;
};

art arts[MAX_N];

int main() {
    int n;

    cin >> n;
    for ( int i = 1; i <= n; i++ )
        cin >> arts[i].size >> arts[i].value;

    sort( arts + 1, arts + 1 + n, []( art a, art b ) {
        return a.size < b.size;
    } );

    long long maxCost = 0, sumValue = 0, maxPartial = -INF;
    for ( int i = 1; i <= n; i++ ) {
        maxPartial = max( maxPartial, -sumValue + arts[i].size );
        sumValue += arts[i].value;
        maxCost = max( maxCost, sumValue - arts[i].size + maxPartial );
    }

    cout << maxCost;
}

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