제출 #168039

#제출 시각아이디문제언어결과실행 시간메모리
168039partha2002Stove (JOI18_stove)C++14
100 / 100
84 ms2136 KiB
#include <bits/stdc++.h> using namespace std; #define FOR(i,o,e) for(int i=o;i<e;i++) int main() { int n,k; cin>>n>>k; int t[n]; FOR(i,0,n) { cin>>t[i]; } int df[n-1]; FOR(i,0,n-1) { df[i]=t[i+1]-t[i]; } sort(df,df+(n-1)); long long int s=0; FOR(i,0,n-k) { s+=df[i]; } s+=k; cout<<s<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...