| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 752236 |
2023-06-02T14:34:05 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
26 ms |
2848 KB |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ii pair<ll, ll>
#define vhg ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pp pair <long long,long long>
using namespace std;
//-------------------------------
ll a[100002], b[100002];
//-------------------------------
int main(){
vhg;
int n,k;
cin >> n >> k;
for (int i=1;i<=n;i++){
cin >> a[i];
}
for (int i=1;i<n;i++){
b[i]=a[i+1]-a[i]-1;
}
sort (b+1,b+n);
long long kq=n;
for (int i=1;i<=n-k;i++) kq=kq+b[i];
cout << kq;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
324 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
324 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
324 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 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 |
19 ms |
2732 KB |
Output is correct |
| 17 |
Correct |
24 ms |
2844 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2832 KB |
Output is correct |
| 19 |
Correct |
26 ms |
2740 KB |
Output is correct |
| 20 |
Correct |
19 ms |
2848 KB |
Output is correct |
| 21 |
Correct |
19 ms |
2780 KB |
Output is correct |
| 22 |
Correct |
18 ms |
2772 KB |
Output is correct |
| 23 |
Correct |
18 ms |
2820 KB |
Output is correct |
| 24 |
Correct |
18 ms |
2760 KB |
Output is correct |
