| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1158803 | rdaba | Stove (JOI18_stove) | C++17 | 12 ms | 1864 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n,k;
cin >> n >> k;
ll a[n+1],b[n+1],sum=0;
k--;
for (int i=1; i<=n; i++) {
cin >> a[i];
if (i>1) b[i-1]=a[i]-a[i-1]-1;
}
sum=a[n]-a[1]+1;
sort (b+1,b+n);
reverse (b+1,b+n);
for (int i=1; i<=k; i++) {
sum-=b[i];
}
cout << sum;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
