# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708443 | 2023-03-11T19:18:41 Z | deme_bz | Stove (JOI18_stove) | C++14 | 59 ms | 3196 KB |
#pragma GCC diagnostic warning "-std=c++11" #include <bits/stdc++.h> #define ll long long #define pb push_back #define all(x) (x).begin(), (x).end() #define ff first #define ss second #define eb emplace_back #define sz(x) (int)x.size() using namespace std; const int N=2e5+5; ll A[N]; void test_case(){ //cout << INT_MAX+1 << endl; int n,k; cin >> n >> k; for(int i=1;i<=n;i++){ cin >> A[i]; } vector<ll> v; for(int i=2;i<=n;i++){ v.pb(A[i]-A[i-1]-1); } if(v.size()>0){ sort(all(v)); } ll answer=A[n]-A[1]+1; //cout << v.size()-1 << endl; if(v.size()>0){ for(int i=v.size()-1;i>=0 && i>=v.size()-1-(k-1)+1;i--){ answer-=v[i]; } } cout << answer << endl; } main(){ //ios_base::sync_with_stdio(false); int T = 1; //cin >> T; while(T--){ test_case(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 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 | 1 ms | 300 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 312 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 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 | 1 ms | 300 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 312 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 2 ms | 320 KB | Output is correct |
11 | Correct | 2 ms | 340 KB | Output is correct |
12 | Correct | 2 ms | 324 KB | Output is correct |
13 | Correct | 3 ms | 340 KB | Output is correct |
14 | Correct | 2 ms | 340 KB | Output is correct |
15 | Correct | 2 ms | 352 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 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 | 1 ms | 300 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 312 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 2 ms | 320 KB | Output is correct |
11 | Correct | 2 ms | 340 KB | Output is correct |
12 | Correct | 2 ms | 324 KB | Output is correct |
13 | Correct | 3 ms | 340 KB | Output is correct |
14 | Correct | 2 ms | 340 KB | Output is correct |
15 | Correct | 2 ms | 352 KB | Output is correct |
16 | Correct | 51 ms | 3152 KB | Output is correct |
17 | Correct | 48 ms | 3120 KB | Output is correct |
18 | Correct | 47 ms | 3144 KB | Output is correct |
19 | Correct | 47 ms | 3120 KB | Output is correct |
20 | Correct | 53 ms | 3160 KB | Output is correct |
21 | Correct | 49 ms | 3116 KB | Output is correct |
22 | Correct | 59 ms | 3196 KB | Output is correct |
23 | Correct | 44 ms | 3084 KB | Output is correct |
24 | Correct | 49 ms | 3188 KB | Output is correct |