제출 #1341926

#제출 시각아이디문제언어결과실행 시간메모리
1341926minhtienArt Exhibition (JOI18_art)C++20
0 / 100
4 ms8004 KiB
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
using namespace std;
const int N=5e5+6;
const ll inf=1e18;
int n;
vector<ii>v(N);
ll pre[N];
ll tong=-inf;
int main()
{
    cin >>n;
    for(int i=1;i<=n;i++){
        cin >> v[i].fi >> v[i].se;
    }
    sort(v.begin()+1,v.begin()+1+n);
    for(int i=1;i<=n;i++){
        pre[i]=pre[i-1]+v[i].se;
    }
    for(int i=1;i<=n;i++){
        ll sum=pre[i]-v[i].fi+v[1].fi;
        tong=max(tong,sum);
    }
    cout << tong;
    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...