제출 #810799

#제출 시각아이디문제언어결과실행 시간메모리
810799nemethmStove (JOI18_stove)C++17
100 / 100
41 ms3140 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long int; const ll mod = 1e9 + 7; int main(){ int n, k; cin >> n >> k; vector<ll> temp(n), v; for(auto& i : temp){ cin >> i; } for(int i = 1; i < n; ++i){ v.push_back(temp[i] - temp[i - 1] - 1); } sort(begin(v), end(v)); ll sol = n; for(int i = 0; i < n - k; ++i){ sol += v[i]; } cout << sol << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...