제출 #240567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
240567		knightron0	Art Exhibition (JOI18_art)	C++14	0 / 100	5 ms	384 KiB

art

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printarray(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long

using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;

int fastexpo(int b, int exp){
    if(exp == 0) return 1;
    if(exp == 1) return b;
    int ans = (fastexpo(b,exp/2) % MOD);
    ans *= ans;
    ans %= MOD;
    if(exp % 2 == 1){
        ans *= b;
    }
    ans %= MOD;
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin>>n;
    vector<pair<int, int> > vec;
    for(int i =0;i<n;i++){
    	int t1, t2;
    	cin>>t1>>t2;
    	vec.pb(mp(t1, t2));
    }
    sort(all(vec));
    int ans = 0;
    int mn = INT_MAX;
    int mx = INT_MIN;
    int sum = 0;
    for(int i= 0;i<n;i++){
    	mn = min(vec[i].fr, mn);
    	mx = max(vec[i].fr, mx);
    	sum += vec[i].sc;
    	ans = max(ans, sum-(mx-mn));
    }
    cout<<ans<<endl;
    return 0;
}

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