Submission #584311

#TimeUsernameProblemLanguageResultExecution timeMemory
584311Newtech66Stove (JOI18_stove)C++17
100 / 100
22 ms2876 KiB
#include<bits/stdc++.h> using namespace std; using lol=long long int; #define endl "\n" const lol mod1=1e9+7,mod2=998244353,mod3=1000000000000000003; const lol inf=1e18+8; const double eps=1e-12; const double PI=acos(-1.0); const int N=3e5+5; #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update using namespace __gnu_pbds; typedef tree<pair<int,int>,null_type,less<pair<int,int> >,rb_tree_tag,tree_order_statistics_node_update> ordered_set; //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int _=1; //cin>>_; while(_--) { int n,k; cin>>n>>k; vector<lol> v(n); for(auto& e:v) cin>>e; vector<lol> d(n-1); for(int i=0;i<n-1;i++) d[i]=v[i+1]-v[i]-1; sort(d.rbegin(),d.rend()); lol S=v[n-1]-v[0]+1; for(int i=0;i<k-1;i++) S-=d[i]; cout<<S; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...