제출 #903645

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
903645		GrindMachine	Cake 3 (JOI19_cake3)	C++17	24 / 100	4078 ms	8232 KiB

cake3

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<pll> a(n+5);
    rep1(i,n) cin >> a[i].ss >> a[i].ff;
    sort(a.begin()+1,a.begin()+n+1);

    ll ans = -inf2;
    vector<ll> opt(n+5,n+1);

    rep1(i,n){
        priority_queue<ll,vector<ll>,greater<ll>> pq;
        ll sum = 0;
        ll best_val = -inf2, best_ind = n+1;

        for(int j = i; j <= n; ++j){
            sum += a[j].ss;
            pq.push(a[j].ss);
            while(sz(pq) > m){
                sum -= pq.top();
                pq.pop();
            }

            if(sz(pq) == m){
                ll val = sum-2*(a[j].ff-a[i].ff);
                amax(ans,val);
                if(val > best_val){
                    best_val = val;
                    best_ind = j;
                }
            }
        }

        opt[i] = best_ind;
    }

    rep1(i,n-1) assert(opt[i] <= opt[i+1]);

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 0 / 76