Submission #481391

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
481391	2021-10-20T16:11:23 Z	anjamilicevic	Stove (JOI18_stove)	C++14	100 / 100	22 ms	2064 KB

stove

#include <bits/stdc++.h>
#define IOS {ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define MAXN 100005

int n, k, t[MAXN], d[MAXN];

using namespace std;

void solve()
{
    cin >> n >> k ;
    for(int i = 0 ; i < n ; i++)cin >> t[i] ;

    for(int i = 0 ; i < n-1 ; i++)
    {
        d[i] = t[i+1]-t[i]-1 ;
    }

    int rez = t[n-1]+1-t[0] ;

    sort(d,d+n-1);
    reverse(d,d+n-1);

    for(int i = 0 ; i < k-1 ; i++)
    {
        rez-=d[i];
    }

    cout << rez << endl ;
}

int main()
{
    IOS ;

    solve() ;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 30.0

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

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	324 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	16 ms	2024 KB	Output is correct
17	Correct	16 ms	1996 KB	Output is correct
18	Correct	16 ms	2064 KB	Output is correct
19	Correct	17 ms	2064 KB	Output is correct
20	Correct	17 ms	1996 KB	Output is correct
21	Correct	20 ms	1996 KB	Output is correct
22	Correct	19 ms	1996 KB	Output is correct
23	Correct	18 ms	1928 KB	Output is correct
24	Correct	22 ms	2060 KB	Output is correct