제출 #1236355

#제출 시각아이디문제언어결과실행 시간메모리
1236355GeforgsStove (JOI18_stove)C++20
100 / 100
12 ms1864 KiB
#include <iostream> #include <iomanip> #include <vector> #include <cmath> #include <algorithm> #include <set> #include <queue> #include <map> #include <unordered_map> #include <stack> #include <bitset> #include <string> #include <cstring> #include <iterator> #include <random> #define ll long long #define ld long double #define inf (ll)(2*1e18) #define sort(a) sort(a.begin(), a.end()) #define reverse(a) reverse(a.begin(), a.end()) #define pb push_back #define endl "\n" using namespace std; void solve(){ ll n, k, res=0, i; cin>>n>>k; --k; vector<ll> a(n); vector<ll> b(n-1); for(i=0;i<n;++i){ cin>>a[i]; } res += a.back() - a.front() + 1; for(i=1;i<n;++i){ b[i-1] = a[i] - a[i-1] - 1; } sort(b); reverse(b); for(i=0;i<k;++i){ res -= b[i]; } cout<<res<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(time(nullptr)); ll t=1; // cin>>t; for(;t>0;--t){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...