제출 #1101757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101757		kasdo	Art Exhibition (JOI18_art)	C++14	0 / 100	1 ms	336 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define speed cin.tie (0) -> sync_with_stdio (0);ios_base::sync_with_stdio(false);cin.tie(0);
void solve()
{
    int n;
    cin>>n;
    pair<int, int> a[n + 5];
    
    for(int i=1; i<=n; i++) cin>>a[i].first>>a[i].second;
    sort(a+1, a+n+1);
    
    int s[n + 5] = {}, mx[n + 5] = {}, p[n + 5] = {}; p[1] = a[1].second;
    for(int i=1; i<=n; i++)
    {
        p[i] = p[i - 1] + a[i].second;
        s[i] = p[i] - a[i].first;
    }
    for(int i=n; i>0; i--) mx[i] = max(mx[i + 1], s[i]);
    
    int ans = 0;
    for(int i=1; i<=n; i++)
    {
        int cur = 0;
        for(int j=i; j<=n; j++) cur = max(cur, p[j] - a[j].first);
        // cur = cur - p[i - 1] + a[i].first;
        // ans = max(ans, cur);
        ans = max(ans, cur - p[i - 1] + a[i].first);
        // ans = max(ans, mx[i] - p[i - 1] + a[i].first);
    }
    cout<<ans<<endl;
}
signed main ()
{
    speed
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    
    int _ = 1;
    // cin>>_;
    
    while(_--) solve();
    
    return 0;
}

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