제출 #1335093

#제출 시각아이디문제언어결과실행 시간메모리
1335093yc11Art Exhibition (JOI18_art)C++20
0 / 100
0 ms344 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
vector<pair<int,int> > n1;
signed main(){
    cin>>n;

    for (int i = 0;i<n;i++){
        int a,b;
        cin>>a>>b;
        n1.push_back(make_pair(a,b));

    }
    sort(n1.begin(),n1.end());
    int ans = 0;
    vector<int> pre;
    pre.resize(n+1);
    pre[0] = 0;
    for (int i = 1;i<n;i++){
        pre[i] = n1[i-1].second+pre[i-1];
    }
    int m = 1e18;
    for (int i = 1;i<n;i++){
        m = min(m,pre[i-1]-n1[i-1].first);
        ans = max(ans,pre[i]-n1[i-1].first-m);

    }
    cout<<ans<<"\n";
    return 0;
    }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...