| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1204698 | cpdreamer | Stove (JOI18_stove) | C++20 | 12 ms | 1988 KiB |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
typedef long long ll;
void solve(){
int n;
cin>>n;
int k;
cin>>k;
int A[n];
for(int i=0;i<n;i++)
cin>>A[i];
vector<ll>dif;
ll c=0;
for(int i=0;i<n-1;i++){
dif.push_back(A[i+1]-A[i]);
}
sort(dif.begin(),dif.end());
for(int i=0;i<n-k;i++){
c+=dif[i]-1;
}
c+=n;
cout<<c<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
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... | ||||
