제출 #1190661

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

art

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
#define Bismillah ios_base::sync_with_stdio(0);cin.tie(0);
#define indexed_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;

const int N = 5e5 + 7;
const int INF = 1e18;
const int MOD = 998244353;

int n , a[N] , b[N];
vector < pair < int , int > > v;



signed main()
{
    Bismillah;
    // freopen("closing.in", "r", stdin);
    // freopen("closing.out", "w", stdout);
    cin >> n;int res = -INF;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        v.push_back({a[i] , b[i]});
    }
    sort(v.begin() , v.end());
    int pref[n];
    for(int i = 0; i < n; i++)
    {
        pref[i] = (i == 0 ? v[i].second : pref[i - 1] + v[i].second);
    }
    
    int sum = 0 , l = 0;
    for(int r = 0; r < n; r++)
    {
        sum += v[r].second;
        while(l < r)
        {
            int sum1 , sum2;
            sum1 = sum - (v[r].first - v[l].first);
            sum2 = sum - v[l].second - (v[r].first - v[l+ 1].first);
            if(sum2 >= sum1)
            {
                sum -= v[l].second;
                l++;
            }
            else break;
        }
        res = max(res , sum - (v[r].first - v[l].first));
    }
    cout << res << endl;
}

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