| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1214491 | candi_ositos | Stove (JOI18_stove) | C++20 | 29 ms | 1096 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin>>N>>K;
vector <int> t, d;
t.resize(N);
d.resize(N-1);
for(int i=0; i<N; ++i)
{
cin>>t[i];
}
sort(t.begin(), t.end());
for(int i=0; i<N-1; ++i)
{
d[i]=t[i+1]-t[i];
}
sort(d.begin(), d.end());
int mt=N;
for(int i=0; i<N-K; ++i)
{
mt+=d[i];
--mt;
}
cout<<mt;
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... | ||||
