제출 #1049853

#제출 시각아이디문제언어결과실행 시간메모리
1049853vjudge1Stove (JOI18_stove)C++17
100 / 100
25 ms3160 KiB
#include <bits/stdc++.h> #define f first #define s second using namespace std; int main() { int n, k; cin >> n >> k; long long mas[n], df[n-1], sm=0; for(int i=0; i<n; i++){ cin >> mas[i]; if(i>0){ df[i-1]=mas[i]-mas[i-1]-1; } } sort(df, df+n-1); for(int i=0; i<n-k; i++){ sm+=df[i]; } cout <<sm+n; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...