제출 #632424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632424		iomoon191	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	212 KiB

art

#include<bits/stdc++.h>
// #define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
#define eb emplace_back
#define For(i,a,b) for(int i=(a); i<=(b); ++i)
#define roF(i,a,b) for(int i=(a); i>=(b); --i)
#define fi first
#define se second
#define mod 998244353
using namespace std;
// using namespace atcoder;
#ifdef DEBUG__
struct db_os{
    ostream& os;
    bool chk;
    template<class T> auto operator<<(T&& x){
        if(!chk) os << ", ";
        chk=0;
        os << x;
        return *this;
    }
};
template<class... T> void db_out(T&&... t){
    (db_os{cerr, 1} << ... << t);
}
#define dbg(...)                                       \
    do{                                                 \
        cerr << __LINE__ << ":" << #__VA_ARGS__ << "=";  \
        db_out(__VA_ARGS__);                              \
        cerr << "\n";                                      \
    }while(0);
#else
#define dbg(...)
#endif
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef long double ld;
const int N=100005;
const ll inf=0x3f3f3f3f;
mt19937 rng(random_device {}()); 
int rand(int a){
    return rng()%a;
}
int n;
pi a[N];
void rmain(){
    cin >> n;
    For(i,1,n) cin >> a[i].fi >> a[i].se;
    sort(a+1, a+n+1);
    For(i,1,n) a[i].se+=a[i-1].se;
    int S=-inf, res=0;
    For(i,1,n){
        S=max(S, a[i].fi-a[i-1].se);
        res=max(res, S+a[i].se-a[i].fi);
    }
    cout << res;
}
signed main(int argc, char *argv[]){
    iostream::sync_with_stdio(0);
    int T=1;
    while(T--) rmain();
    return 0;
}

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