| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1331116 | norrawichzzz | Stove (JOI18_stove) | C++20 | 15 ms | 2372 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
const int INF = 4e18;
void solve() {
int n,k;
cin>> n>> k;
vector<int> a(n);
for (int i=0; i<n; i++) cin>> a[i];
int ans = a[n-1] - a[0] + 1;
vector<int> g;
for (int i=1; i<n; i++) g.push_back(a[i]-1-a[i-1]);
sort(g.rbegin(), g.rend());
for (int i=0; i<k-1; i++) {
ans -= g[i];
}
cout<< ans;
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
int t;
t=1;
while (t--) {
solve();
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
