제출 #1017502

#제출 시각아이디문제언어결과실행 시간메모리
1017502vjudge1Stove (JOI18_stove)C++17
100 / 100
41 ms2260 KiB
#include <iostream> #include <cmath> #include <vector> #include <string> #include <algorithm> #include <set> #include <map> #include <deque> using namespace std; #define int long long int mod = 1e18 + 7; signed main(){ int n , k , mx = 0 , mn = mod; cin >> n >> k; int a[n]; vector <int> v; for(int i = 0; i < n; i++){ cin >> a[i]; if(i != 0){ v.push_back(abs(a[i] - a[i - 1])); } mx = max(mx , a[i]); mn = min(mn , a[i]); } mx++; mx -= mn; sort(v.begin() ,v.end() ); reverse(v.begin() , v.end() ); for(int i = 0; i < min(n - 1LL , k - 1LL); i++){ mx -= v[i] - 1; } cout << mx; return 0; } //AZIM_BEST
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...