제출 #1137451

#제출 시각아이디문제언어결과실행 시간메모리
1137451PlayVoltzStove (JOI18_stove)C++20
100 / 100
18 ms2444 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin>>n>>k, --k; vector<int> vect(n); for (int i=0; i<n; ++i)cin>>vect[i]; sort(vect.begin(), vect.end()); priority_queue<int> pq; for (int i=1; i<n; ++i)pq.push(vect[i]-vect[i-1]-1); int ans=vect.back()-vect[0]+1; while (k--){ 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...