# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
831322 | 2023-08-20T04:37:46 Z | manhtuan22007 | Stove (JOI18_stove) | C++14 | 18 ms | 3240 KB |
#include <bits/stdc++.h> #define int long long #define ll long long using namespace std; const int maxn = 1e5 + 10; int n , k , a[maxn]; int32_t main() { cin.tie(0)->sync_with_stdio(0); if(fopen(".inp" , "r")){ freopen(".inp" , "r" , stdin); freopen(".out" , "w" , stdout); } cin >> n >> k; for(int i = 1 ; i <= n ; i ++) cin >> a[i]; vector<int> v; for(int i = 2 ; i <= n ; i ++){ v.push_back(a[i] - a[i - 1] - 1); } sort(v.begin() , v.end()); int res = a[n] - a[1] + 1; for(int i = n - 2 ; i >= n - k ; i --){ res -= v[i]; } cout << res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 340 KB | Output is correct |
12 | Correct | 1 ms | 340 KB | Output is correct |
13 | Correct | 1 ms | 340 KB | Output is correct |
14 | Correct | 1 ms | 340 KB | Output is correct |
15 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 340 KB | Output is correct |
12 | Correct | 1 ms | 340 KB | Output is correct |
13 | Correct | 1 ms | 340 KB | Output is correct |
14 | Correct | 1 ms | 340 KB | Output is correct |
15 | Correct | 1 ms | 340 KB | Output is correct |
16 | Correct | 15 ms | 3164 KB | Output is correct |
17 | Correct | 15 ms | 3148 KB | Output is correct |
18 | Correct | 14 ms | 3240 KB | Output is correct |
19 | Correct | 14 ms | 3160 KB | Output is correct |
20 | Correct | 18 ms | 3156 KB | Output is correct |
21 | Correct | 15 ms | 3176 KB | Output is correct |
22 | Correct | 15 ms | 3156 KB | Output is correct |
23 | Correct | 14 ms | 3156 KB | Output is correct |
24 | Correct | 14 ms | 3180 KB | Output is correct |