답안 #868911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868911	2023-11-02T12:26:10 Z	rockstar	Stove (JOI18_stove)	C++17	100 / 100	16 ms	2904 KB

stove

// #pragma GCC optimize("O3,unroll-loops,inline,no-stack-protector")
// #pragma GCC target("avx,avx2,sse3,ssse3,sse4.1,sse4.2,fma,bmi2,abm,popcnt,mmx,tune=native")

#include <bits/stdc++.h>

using namespace std;

#define trace(x) cerr << #x << ": " << (x) << endl;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

using ll = long long;

#define int ll

constexpr int INF = numeric_limits<int>::max() / 2;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> t(n);
    for (int& i : t)
        cin >> i;
    vector<int> diff(n - 1);
    for (int i = 1; i < n; ++i)
        diff[i - 1] = t[i] - t[i - 1];
    sort(all(diff));
    int ans = 0;
    for (int i = 0; i <= n - 1 - k; ++i)
        ans += diff[i];
    cout << ans + k;
}

signed main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
#ifdef LOCAL
    cerr << '\n' << "time = " << clock() * 1.0 / CLOCKS_PER_SEC << '\n';
#endif
    return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	452 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	456 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	460 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	452 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	456 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	460 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	468 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	348 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	452 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	456 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	460 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	468 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	348 KB	Output is correct
16	Correct	14 ms	2788 KB	Output is correct
17	Correct	14 ms	2636 KB	Output is correct
18	Correct	14 ms	2652 KB	Output is correct
19	Correct	16 ms	2652 KB	Output is correct
20	Correct	14 ms	2652 KB	Output is correct
21	Correct	15 ms	2788 KB	Output is correct
22	Correct	14 ms	2644 KB	Output is correct
23	Correct	16 ms	2904 KB	Output is correct
24	Correct	14 ms	2772 KB	Output is correct