Submission #1242949

#TimeUsernameProblemLanguageResultExecution timeMemory
1242949whatisdpStove (JOI18_stove)C++17
100 / 100
12 ms584 KiB
#include<bits/stdc++.h> using namespace std; void solve() { int n,k; cin>>n>>k; if (n==1) { cout<<1; return; } vector<int> diff(n-1); int x1,x2;cin>>x1; for(int i=0;i<n-1;i++) { cin>>x2; diff[i]=x2-x1; x1=x2; } //for(auto e:diff) cout<<e<<' '; //cout<<'\n'; sort(diff.begin(), diff.end()); int s=0; for(int i=0;i<n-k;i++) s+=diff[i]-1; cout<<s+n<<'\n'; } int main() { cin.tie(0)->sync_with_stdio(0); //int t;cin>>t;for(int i=1;i<=t;i++) { // cout<<"CASE "<<i<<": "; solve(); //} }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...