제출 #571695

#제출 시각아이디문제언어결과실행 시간메모리
571695Quan2003Stove (JOI18_stove)C++17
100 / 100
51 ms2892 KiB
#include <bits/stdc++.h> #include <iostream> #include<queue> #include<vector> #include<utility> using namespace std; typedef long long ll; const int sz=101; const int sz1=2e5+1; int n,x,k,i,j,w,m; ll res=1e18; ll ans=0; int movex[4]={0,0,1,-1}; int movey[4]={-1,1,0,0}; ll c[sz1]; vector<ll>adj[sz]; ll d[sz1]; vector<array<ll,2>>a; ll dp[sz][sz]; int main(){ cin>>n>>k; for(int i=1;i<=n;i++){ cin>>d[i]; } for(int i=2;i<=n;i++){ c[i-1]=d[i]-d[i-1]; } sort(c+1,c+n); ans=k; for(int i=1;i<=n-k;i++){ ans+=c[i]; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...