Submission #1318440

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318440		_unknown_2010	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	332 KiB

art

//#ifndef khos
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#endif

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef khos
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_multiset = tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>;

#define int int64_t
#define vi vector
#define ss second
#define ff first
#define TESTCASES
#define all(x) (x).begin(), (x).end()
const int mod = 1e9+7;
const int MAXN=2000000+5;
const int inf=1e18;

void solution() {
    int n;
    cin >> n;
    vi<int> a(n), b(n);
    vi<pair<int,int>> p;
    for(int i=0; i<n; i++){
        int x, y;
        cin >> x >> y;
        p.push_back({x, y});
    }
    sort(all(p));
    for(int i=0; i<n; i++)a[i]=p[i].ff, b[i]=p[i].ss;
    map<int,int> mp;
    for(int i=0; i<n; i++){
        mp[a[i]]+=b[i];
    }
    int l=0, sum=0, mx=0;
    for(int i=0; i<n; i++){
        sum+=b[i];
        while(a[i]-a[l]>mp[a[l]]){
            sum-=b[l++];
        }
        mx=max(mx, sum-a[i]+a[l]);
    }
    cout << mx;

/*

4 1
1 5
10 3
9 1
4 2
5 3
    

1 5
4 1
4 2
5 3
9 1
10 3

*/
}
int32_t main(){
    clock_t tStart = clock();
    #ifdef khos
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int q = 1;
    #ifdef TESTCASES
        // cin >> q;
    #endif
    while(q--) {
        solution();
        cout << '\n';
    }
    cerr<<fixed<<setprecision(3)<<"\nTime Taken: "<<(double)(clock()- tStart)/CLOCKS_PER_SEC<<endl;
}

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