| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1276901 | kolpo0210 | Stove (JOI18_stove) | C++20 | 39 ms | 1444 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<int>v(n);
for(int i=0; i<n; i++) cin >> v[i];
if(k>=n)
{
cout << n;
return 0;
}
sort(v.begin(), v.end());
vector<int>g;
for(int i=0; i<n-1; i++)
{
int tmp = v[i+1]-(v[i]+1);
g.push_back(tmp);
}
sort(g.begin(), g.end(), greater<>());
int sum=0;
for(int i=0; i<k-1; i++)
{
sum+=g[i];
}
cout << (v[n-1]+1-v[0])-sum;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
