oj.uz

Submission #1091256

# Submission time Handle Problem Language Result Execution time Memory
1091256 2024-09-20T09:37:47 Z ___ Stove (JOI18_stove) C++17
100 / 100
 15 ms 3292 KB 
#include <bits/stdc++.h>
#define int long long int
#define ff first
#define ss second
#define FT ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
vector <int> diff;
const int maxn = 1e5 + 10;
int t[maxn];
signed main()
{
	FT;
	int n , k;
	cin >> n >> k;
	for (int i = 1 ;  i <= n ; i++)
	{
		cin >> t[i];
	}
	for (int i = 2 ; i <= n ; i++)
	{
		diff.push_back(t[i] - (t[i - 1] + 1));
	}
	sort (diff.begin() , diff.end());
	int ans = n;
	for (int i = 0 ; i < n - k ; i++)
	{
		ans += diff[i];
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 476 KB Output is correct
16 Correct 14 ms 3292 KB Output is correct
17 Correct 13 ms 3292 KB Output is correct
18 Correct 13 ms 3292 KB Output is correct
19 Correct 15 ms 3280 KB Output is correct
20 Correct 13 ms 3288 KB Output is correct
21 Correct 13 ms 3292 KB Output is correct
22 Correct 13 ms 3292 KB Output is correct
23 Correct 13 ms 3292 KB Output is correct
24 Correct 14 ms 3288 KB Output is correct