Submission #166051

#TimeUsernameProblemLanguageResultExecution timeMemory
166051davooddkareshkiStove (JOI18_stove)C++17
100 / 100
30 ms2168 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define F first
#define S second

const int maxn = 1e5+10;
const int mod = 1e9+7;

int n, k;
int a[maxn], d[maxn];

int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>> n >> k;
    for(int i = 0; i < n; i++)
    {
        cin>> a[i];
        if(i)
            d[i-1] = a[i] - a[i-1];
    }
    sort(d, d+n-1);
    int ans = n;
    for(int i = 0; i < n-k; i++)
        ans += d[i] - 1;
    cout<< ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...