# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1241921 | truongnhattung | Stove (JOI18_stove) | C++20 | 31 ms | 1220 KiB |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main()
{
int n,k;
cin>>n>>k;
for (int i=1;i<=n;i++) {
cin>>a[i];
}
vector <int> p;
for (int i=2;i<=n;i++) {
p.push_back(a[i]-a[i-1]-1);
}
sort(p.rbegin(),p.rend());
int sum=a[n]-a[1]+1;
for (int i=0;i<k-1;i++) {
sum-=p[i];
}
cout<<sum;
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... |