제출 #854341

#제출 시각아이디문제언어결과실행 시간메모리
854341dungzStove (JOI18_stove)C++17
0 / 100
0 ms344 KiB
#include<bits/stdc++.h> #define ll long long #define fo(i,a,b) for(int i=a;i<=b;++i) #define fod(i,a,b) for(int i=a;i>=b;--i) #define fi first #define se second #define task "stove" using namespace std; const int N=1e5+5; const ll oo=1e18; const int base=311; int n,k; int a[N]; int ans; vector<int>vec; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n>>k; fo(i,1,n)cin>>a[i]; ans=a[n]+2-a[1]; fo(i,1,n-1) vec.emplace_back(a[i+1]-a[i]); sort(vec.begin(),vec.end()); fod(i,vec.size()-1, 0) { if(k==1)break; ans-=vec[i]; k--; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...