제출 #1229051

#제출 시각아이디문제언어결과실행 시간메모리
1229051tutientdStove (JOI18_stove)C++20
0 / 100
0 ms324 KiB
#include<bits/stdc++.h> #define int long long #define ff(i,a,b) for(int i=a;i<=b;i++) #define fb(i,a,b) for(int i=a;i>=b;i--) #define all(v) v.begin(),v.end() #define pushb push_back #define DEBUG cout<<"nO ERROR";return; #define re return using namespace std; void faster(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } const int N=1e5+5;const int INF=1e18; int n,k; int32_t main() { faster(); cin >> n >> k; vector<int> t(n); for (int i = 0; i < n; ++i) cin >> t[i]; vector<int> gaps; ff(i,0,n-2){ int gap = t[i + 1] - t[i] - 1; if(gap > 0) gaps.push_back(gap); } int ans=n; sort(gaps.begin(), gaps.end()); for (int i = 0; i < n - k && i < (int)gaps.size(); ++i) { ans += gaps[i]; } cout <<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...