제출 #703360

#제출 시각아이디문제언어결과실행 시간메모리
7033601075508020060209tcStove (JOI18_stove)C++14
100 / 100
50 ms3192 KiB
//#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define int long long #define X first #define Y second int n;int k; int ar[500005]; signed main(){ cin>>n>>k; for(int i=1;i<=n;i++){ cin>>ar[i]; } int ans=n; priority_queue<int,vector<int>,greater<int>>pq; for(int i=2;i<=n;i++){ pq.push(ar[i]-ar[i-1]-1); } for(int i=1;i<=n-k;i++){ ans+=pq.top(); pq.pop(); }cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...