| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229050 | lazyboi009 | Stove (JOI18_stove) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n,k;
cin >> n >> k;
vector<int> time(n);
for(int i=0;i<n;i++) cin >> time[i];
long long ttime=time[n-1]+1-time[0];
if (k>=n) {
cout<<n;
return 0;
}
vector<int> kc;
for(int i=0;i<n-1;i++)
{
kc.push_back(time[i+1]-time[i]-1);
}
sort(kc.begin(),kc.end());
for(int i=0;i<k-1;i++)
{
ttime-=kc[i];
}
cout << ttime;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
