제출 #1290438

#제출 시각아이디문제언어결과실행 시간메모리
1290438gecepanteriStove (JOI18_stove)C++20
100 / 100
48 ms2336 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") #define int long long int32_t main(){ int n = 0, k = 0; cin >> n >> k; k--; int dizi[n]; int cevap = n; vector <int> bosluklar; for(int i = 0; i < n; i++){ cin >> dizi[i]; } for(int i = 0; i < n - 1; i++){ bosluklar.push_back(dizi[i + 1] - (dizi[i] + 1)); } sort(bosluklar.begin(), bosluklar.end()); for(int i = 0; i < k; i++){ bosluklar.pop_back(); } for(int tmp : bosluklar){ cevap += tmp; } cout << cevap << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...