| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 575162 |
2022-06-09T19:42:19 Z |
JANCARAPAN |
Stove (JOI18_stove) |
C++17 |
|
24 ms |
3216 KB |
#include <bits/stdc++.h>
using namespace std;
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) ( max_element((a).begin(), (a).end()) - (a).begin())
#define int long long
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define endl '\n'
#define sz(x) (int)size(x)
#define rsz(a,x) assign(a,x)
const int INF = LLONG_MAX;
const int MOD = 1000000007;
const int MAXN = 100005;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,k; cin >> n >> k;
vi a(n), dif;
for (int i=0; i<n; i++) cin >> a[i];
int ans = a[n-1]-a[0]+1;
for (int i=1; i<n; i++)
dif.pb(a[i]-a[i-1]-1);
sort(rall(dif));
for (int i=0; i<k-1; i++)
ans-=dif[i];
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
320 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
320 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
336 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 |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
320 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
320 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
336 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 |
18 ms |
3148 KB |
Output is correct |
| 17 |
Correct |
19 ms |
3112 KB |
Output is correct |
| 18 |
Correct |
24 ms |
3148 KB |
Output is correct |
| 19 |
Correct |
18 ms |
3148 KB |
Output is correct |
| 20 |
Correct |
18 ms |
3216 KB |
Output is correct |
| 21 |
Correct |
18 ms |
3144 KB |
Output is correct |
| 22 |
Correct |
23 ms |
3140 KB |
Output is correct |
| 23 |
Correct |
18 ms |
3148 KB |
Output is correct |
| 24 |
Correct |
19 ms |
3152 KB |
Output is correct |
