제출 #1228871

#제출 시각아이디문제언어결과실행 시간메모리
1228871liamczarStove (JOI18_stove)C++20
100 / 100
13 ms1480 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n,k; cin >> n >> k; vector<int> t(n); for(int i=0;i<=n-1;i++) cin >> t[i]; vector<int> gaps; for(int i=0;i<=n-2;i++){ int gap=t[i+1]-(t[i]+1); gaps.push_back(gap); } sort(gaps.begin(),gaps.end()); int tong=n; for(int i=0; i<n-k; i++){ tong += gaps[i]; } cout << tong << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...