제출 #1049732

#제출 시각아이디문제언어결과실행 시간메모리
1049732vjudge1Stove (JOI18_stove)C++98
100 / 100
14 ms1508 KiB
#include <bits/stdc++.h> using namespace std; //abeke typedef long long ll; typedef unsigned long long ull; #define all(x) x.begin(), x.end() //#define sz(x) (int)x.size() #define pb push_back #define speed ios::sync_with_stdio( false); cin.tie(nullptr); cout.tie(0); #define forn(i, n) for(int i = 0; i < int(n); i++) #define eb emplace_back #define nl '\n' #define f first #define s second #define gcd __gcd #define ins insert const int inf = INT_MAX; const int mod = 1e9+7; const int N = 2e5+5; void solve() { int n, k; cin >> n >> k; vector<int> a(n); forn (i, n) cin >> a[i]; vector<int> v; int ans = a[n-1]-a[0]+1; for (int i = 1; i < n; i++) { v.pb(a[i]-a[i-1]-1); } sort(all(v)); k--; for (int i = v.size()-1; i >= 0 && k > 0; i--) { ans -= v[i]; k--; } cout << ans; } int main() { speed; solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...