제출 #1004886

#제출 시각아이디문제언어결과실행 시간메모리
1004886MarwenElarbiStove (JOI18_stove)C++17
100 / 100
40 ms2408 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define fi first #define se second #define ll long long #define pb push_back #define ii pair<int,int> const int nax=5e2+5; int main() { int n,k; cin>>n>>k; int tab[n]; for (int i = 0; i < n; ++i) { cin>>tab[i]; } vector<int> nabba; for (int i = 1; i < n; ++i) { nabba.pb(tab[i]-tab[i-1]-1); } sort(nabba.begin(),nabba.end()); int sum=tab[n-1]+1-tab[0]; for (int i = nabba.size()-1; i >= (int)nabba.size()-k+1 ; --i) { sum-=nabba[i]; } cout <<sum<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...