제출 #200102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200102		aloo123	Art Exhibition (JOI18_art)	C++14	50 / 100	1096 ms	24824 KiB

art

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
using namespace std;

const ll N = 5e5+100;
const ll MOD = 1e9+7;
ll pre[N];
int main()
{

    ll n;
    cin>>n;


    pll a[n+1];
    for(int i =1;i<=n;i++)cin>>a[i].f >> a[i].s;

    sort(a+1,a+n+1);
    for(int i =1;i<=n;i++){
        pre[i] = pre[i-1] + a[i].s;
    }
    ll ans = 0;
    for(int i =1;i<=n;i++){
        for(int j =i;j<=n;j++){ 
            ans = max(ans,((pre[j]-pre[i-1]-(a[j].f-a[i].f))));
        }
    }
    cout<<ans<<endl;

    
    return 0;
}

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