oj.uz

Submission #166051

# Submission time Handle Problem Language Result Execution time Memory
166051 2019-11-30T12:19:13 Z davooddkareshki Stove (JOI18_stove) C++17
100 / 100
 30 ms 2168 KB 
#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;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 296 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 25 ms 2044 KB Output is correct
17 Correct 30 ms 2040 KB Output is correct
18 Correct 25 ms 2040 KB Output is correct
19 Correct 25 ms 2168 KB Output is correct
20 Correct 25 ms 2168 KB Output is correct
21 Correct 25 ms 2168 KB Output is correct
22 Correct 25 ms 2040 KB Output is correct
23 Correct 25 ms 2040 KB Output is correct
24 Correct 25 ms 2040 KB Output is correct