제출 #1281310

#제출 시각아이디문제언어결과실행 시간메모리
1281310xorreverseStove (JOI18_stove)C++20
100 / 100
37 ms1432 KiB
#include<bits/stdc++.h> using namespace std; int n, k, t[100005]; int main(){ cin >> n >> k; vector<int> dd; for (int i = 1; i <= n; i ++){ cin >> t[i]; } int res = t[n] + 1 - t[1]; // cout << res << endl; for (int i = 2; i <= n; i ++){ dd.push_back(t[i] - t[i - 1] - 1); } k --; sort(dd.begin(), dd.end()); while (k -- && !dd.empty()){ res -= dd.back(); dd.pop_back(); } // t[n] - t[1] cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...