Submission #498286

# Submission time Handle Problem Language Result Execution time Memory
498286 2021-12-24T19:28:04 Z OrazB Stove (JOI18_stove) C++14
0 / 100
0 ms 204 KB
#include <bits/stdc++.h>
#define N 100005
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
using namespace std;

ll n, k, ans, a[N], m[N];
vector <pii> v;

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i];
	sort(a + 1, a + n + 1);
	for (int i = 1; i < n; i++) v.pb({a[i + 1] - a[i], i});
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());
	for (int i = 0; i < k - 1; i++) m[v[i].ss] = 1;
	for (int i = 2; i <= n; i++){
		if (m[i - 1]) ans++;
		else ans += a[i] - a[i - 1] + 1;
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -