Submission #712190

# Submission time Handle Problem Language Result Execution time Memory
712190 2023-03-18T10:47:39 Z dozer Stove (JOI18_stove) C++14
0 / 100
1 ms 336 KB
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 200005

const int modulo = 1e9 + 7;


int arr[N];

int32_t main()
{
	fastio();


	int n, k;
	cin>>n>>k;
	for (int i = 1; i <= n; i++)
		cin>>arr[i];

	sort(arr + 1, arr + 1 + n);

	vector<int> diff;
	for (int i = 2; i <= n; i++) diff.pb(arr[i] - arr[i - 1] - 1);
	sort(diff.rbegin(), diff.rend());
	int ans = arr[n];
	for (int i = 0; i < k - 1; i++) ans -= diff[i];
	cout<<ans<<endl;
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -