# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
967631 | 2024-04-22T14:26:38 Z | vjudge1 | Stove (JOI18_stove) | C++17 | 15 ms | 2140 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long int main() { cin.tie(0)->sync_with_stdio(false); int n,k; cin >> n >> k; vector<int> t(n); for (int i=0;i<n;i++) { cin >> t[i]; } vector<int> range(n-1); ll cost=n; for (int i=0;i<n-1;i++) { range[i] = t[i+1]-t[i]-1; } sort(range.begin(),range.end()); for (int i=0;i<k-1;i++) { range.pop_back(); } for (int i=0;i<range.size();i++) { cost+=range[i]; } cout << cost; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 460 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 460 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 496 KB | Output is correct |
11 | Correct | 1 ms | 468 KB | Output is correct |
12 | Correct | 2 ms | 604 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 460 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 496 KB | Output is correct |
11 | Correct | 1 ms | 468 KB | Output is correct |
12 | Correct | 2 ms | 604 KB | Output is correct |
13 | Correct | 1 ms | 348 KB | Output is correct |
14 | Correct | 1 ms | 348 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
16 | Correct | 15 ms | 1884 KB | Output is correct |
17 | Correct | 14 ms | 1880 KB | Output is correct |
18 | Correct | 15 ms | 2140 KB | Output is correct |
19 | Correct | 15 ms | 1884 KB | Output is correct |
20 | Correct | 14 ms | 2000 KB | Output is correct |
21 | Correct | 14 ms | 1884 KB | Output is correct |
22 | Correct | 14 ms | 1884 KB | Output is correct |
23 | Correct | 14 ms | 1900 KB | Output is correct |
24 | Correct | 14 ms | 1884 KB | Output is correct |