| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1260477 | Megalosaurus | Stove (JOI18_stove) | C++20 | 30 ms | 2308 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
signed main()
{
int n, k;
cin >> n >> k;
vector<int>x, v(n);
for(int i = 0; i < n; i++)
{
cin >> v[i];
if(i) x.push_back(v[i]-v[i-1]-1);
}
sort(x.begin(), x.end());
int sum = 0;
for(int i = 0; i < n-k; i++) sum += x[i];
cout << sum+n;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
