제출 #1228772

#제출 시각아이디문제언어결과실행 시간메모리
1228772shio_vnStove (JOI18_stove)C++20
100 / 100
12 ms1480 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define pi pair const int N=1e5+10; int a[N]; pair<int,int> q[N]; bool vis[N]={0}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n,k; cin>>n>>k; for(int i=0;i<n;i++) { cin>>a[i]; } int t=a[n-1]-a[0]+1; vector<int> vec; for(int i=1;i<n;i++) { vec.push_back(a[i]-a[i-1]-1); } sort(vec.rbegin(),vec.rend()); for(int i=0;i < k - 1 && i < vec.size();i++) { t-=vec[i]; } cout<<t; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...