제출 #1033844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033844		vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	122 ms	12164 KiB

art

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
#define cd complex<double>
#define ld long double
#define all(x) (x).begin(), (x).end()
#define iii tuple<int, int, int>
const ll mod = 1e9 + 7;
const ll INF = 1e18L + 5;
const double PI = acos(-1);
const int block = 320;
const int N = 5e5;
int tc, tt = 1;

int n;
pair<ll, ll> a[N + 5];
ll f[N + 5];

void solve() {
    cin>>n;
    for(int i=1; i<=n; i++) cin>>a[i].fi>>a[i].se;
    sort(a + 1, a + 1 + n);
    for(int i=1; i<=n; i++) f[i] = f[i - 1] + a[i].se;
    ll mx = 0, ans = a[1].se;
    mx = a[1].fi - f[0];
    for(int i=2; i<=n; i++) {
        ans = max(ans, a[i].se);
        ans = max(ans, f[i] - a[i].fi + mx);
        mx = max(mx, a[i].fi - f[i - 1]);
    }
    cout<<ans;
}   

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    for(tc=1; tc<=tt; tc++) solve();
    cerr<<"\nTime elapsed: "<<1000.0*clock()/CLOCKS_PER_SEC<<" ms.\n";
    return 0;
}

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