oj.uz

Submission #689365

# Submission time Handle Problem Language Result Execution time Memory
689365 2023-01-28T10:08:50 Z Acanikolic Stove (JOI18_stove) C++14
100 / 100
 23 ms 3268 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9+7;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll n,k;
    cin >> n >> k;
    vector<ll>a(n),b;
    for(ll i=0;i<n;i++) cin >> a[i];
    for(ll i=1;i<n;i++) b.push_back(a[i]-a[i-1]);
    if(k>=n)
    {
        cout << n;
        return 0;
    }
    if(k==1)
    {
        cout << a[n-1]+1-a[0];
        return 0;
    }
    ll R=k;
    ll treba=n-k;
    sort(b.begin(),b.end());
    for(ll i=0;i<treba;i++)
    {
        R+=b[i];
     //   cout << b[i] << endl;
    }
    cout << R;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 21 ms 3156 KB Output is correct
17 Correct 17 ms 3140 KB Output is correct
18 Correct 17 ms 3220 KB Output is correct
19 Correct 19 ms 3268 KB Output is correct
20 Correct 19 ms 3144 KB Output is correct
21 Correct 18 ms 3148 KB Output is correct
22 Correct 23 ms 3140 KB Output is correct
23 Correct 18 ms 3144 KB Output is correct
24 Correct 18 ms 3156 KB Output is correct