| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290490 | bilgetux38 | Stove (JOI18_stove) | C++20 | 14 ms | 2012 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, k;
cin>>n>>k;
vector<int> vec(n);
vector<int> arl(n-1);
for (int i = 0; i < n; ++i)
{
cin>>vec[i];
}
for (int i = 0; i < n-1; ++i)
{
arl[i] = vec[i+1] - (vec[i] + 1) ;
}
sort(arl.begin(),arl.end());
int ans = vec[n-1] +1 - vec[0];
for (int i = n-1; i > n-k; --i)
{
ans -= arl[i-1];
}
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... | ||||
