Submission #1206056

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206056		tamzid	Stove (JOI18_stove)	C++20	100 / 100	12 ms	1480 KiB

stove

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << '\n';
#define dbg_var(x,y) cout<<y<<"# Debugging: "<<x<<'\n';
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
    int n,k;
    cin>>n>>k;
    vector<int> t(n);
    cinv(t);
    if(n <= k)
    {
        cout<<n<<'\n';
        return;
    }
    vector<int> gaps;
    for(int i=1;i<n;++i)
    {
        gaps.pb(t[i] - (t[i-1] +1));
    }
    int total = n;
    sort(gaps.begin(),gaps.end());
    for(int i=0;i<n-k;++i)
    {
        total+=gaps[i];
    }
    cout<<total;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50