제출 #843775

#제출 시각아이디문제언어결과실행 시간메모리
843775Iliya_Stove (JOI18_stove)C++17
100 / 100
16 ms2356 KiB
//IN THE NAME OF GOD #include<bits/stdc++.h> #pragma GCC optimize("O2,unroll-loops") #define endl '\n' #define F first #define S second using namespace std; typedef long long ll; typedef long double dll; const int N = 1e5+7; int a[N]; vector<int> v; int32_t main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n,k; cin >> n >> k; for(int i=1; i<=n; i++) cin >> a[i]; sort(a+1,a+n+1); for(int i=1; i<n; i++) v.push_back(a[i+1]-(a[i]+1)); sort(v.begin(),v.end()); int ans = a[n] + 1 - a[1]; for(int i=1; i<k; i++){ ans -= v.back(); v.pop_back(); } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...