Submission #586977

#	Time	Username	Problem	Language	Result	Execution time	Memory
586977		BT21tata	Stove (JOI18_stove)	C++17	100 / 100	20 ms	2024 KiB

stove

#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define setp fixed<<setprecision
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
const ll MOD=1e9+7;
const ll mod=(1ll<<31)-1;
const ld eps=1e-8;
using namespace std;
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

int n, k, ans, t[100005], a[100005];

int main()
{
    SPEED;
    cin>>n>>k;
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    for(int i=1; i<n; i++)
    {
        a[i-1]=t[i]-t[i-1]-1;
    }
    ans=t[n-1]-t[0]+1;
    sort(a, a+n-1);
    k--;
    for(int i=n-2; i>=0; i--)
    {
        if(k) ans-=a[i], k--;
    }
    cout<<ans<<endl;
    return 0;
}
/*
1 0
2 2
5 0
6 1
8 2
11 1
13 1
15 0
16 3
20
*/

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