# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1254753 | MuhammadSaram | Stove (JOI18_stove) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
vector<int> v;
for (int i=0;i<n;i++)
cin>>a[i];
for (int i=0;i+1<n;i++)
v.push_back(a[i]-a[i+1]+1);
sort(v.begin(),v.end());
v.resize(k-1);
int ans=a[n-1]-a[0];
for (int i:v) ans+=i;
cout<<ans<<endl;
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... |