제출 #1288739

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288739		ghammazhassan	Art Exhibition (JOI18_art)	C++20	0 / 100	1 ms	572 KiB

art

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e6+3;
const int inf = 1e14;
const int LOG=18;
const int N=1e6+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve()
{   
    cin >> n;
    vector<pair<int,int>>a(n);
    for (int i=0;i<n;i++){
        cin >> a[i].fi >> a[i].se;
    }
    sort(a.begin(),a.end());
    int ans=a[0].se;
    int l=0;
    int r=1;
    c=a[0].se;
    int mn=a[0].fi;
    while (r<n){
        if (a[r].fi-a[r-1].fi>=c){
            l=r;
            c=0;
            mn=a[r].fi;
        }
        c+=a[r].se;
        ans=max(ans,c-(a[r].fi-mn));
        r++;
        // cout << c << endl;
    }
    cout << ans << endl;
}
signed main()    
{   

    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
} 

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