제출 #1288871

#제출 시각아이디문제언어결과실행 시간메모리
1288871AbdullahIshfaqStove (JOI18_stove)C++20
100 / 100
14 ms832 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define MOD 998244353 const int N = 100005; int n, k, a[N], r; void solve() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; r = a[n - 1] - a[0] + 1; adjacent_difference(a, a + n, a); sort(a + 1, a + n, greater<int>()); for (int i = 1; i < k; i++) r -= (a[i] - 1); cout << r << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t = 1; // cin >> t; for (int i = 1; i <= t; i++) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...