제출 #1258349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258349		meisean2009	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	320 KiB

art

#include <bits/stdc++.h>
#define int long long 
using namespace std;
typedef pair<int,int> p;
#define f first 
#define s second 

int n, ans = 0, cur = 0;
vector<p> artworks;
int bestprf = 0;  // Initialize to 0 instead of LLONG_MAX/2

signed main(){
    cin >> n;
    for (int i = 0; i < n; i++){
        int a, b;
        cin >> a >> b;  // size, value
        artworks.push_back(make_pair(a, b));
    }
    
    sort(artworks.begin(), artworks.end());  // sort by size
    
    for (auto [sze, val] : artworks){
        cur += val;
        ans = max(ans, cur - sze - bestprf);
        bestprf = min(bestprf, cur - val - sze);
    }
    
    cout << ans << endl;
    return 0;
}

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