# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597303 | Abdulmohsen1284 | Stove (JOI18_stove) | C++14 | 23 ms | 3232 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void usaco(){freopen("cruise.out","w",stdout);freopen("cruise.in","r",stdin);}
long long a[2000005],c[2000005];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
long long cost=n;
vector <long long> v;
for(int i=1;i<n;i++)
{
v.push_back(a[i]-a[i-1]-1);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
while(k<n)
{
cost+=v[v.size()-1];
v.pop_back();
k++;
}
cout<<cost;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |