| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 972352 |
2024-04-30T11:24:04 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
15 ms |
2700 KB |
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;
int tt = 1, n, k;
ll a[100005], sum;
vector<int> v;
int main(){
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(i > 1) v.push_back(a[i] - a[i - 1]);
}
sum = a[n] - a[1] + 1;
sort(v.begin(), v.end());
while(k > 1){
k--;
sum = sum - v.back() + 1;
v.pop_back();
}
cout << sum;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
464 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 |
464 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
464 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 |
464 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 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 |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
476 KB |
Output is correct |
| 12 |
Correct |
1 ms |
524 KB |
Output is correct |
| 13 |
Correct |
1 ms |
484 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
464 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 |
464 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 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 |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
476 KB |
Output is correct |
| 12 |
Correct |
1 ms |
524 KB |
Output is correct |
| 13 |
Correct |
1 ms |
484 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
14 ms |
2520 KB |
Output is correct |
| 17 |
Correct |
14 ms |
2520 KB |
Output is correct |
| 18 |
Correct |
14 ms |
2552 KB |
Output is correct |
| 19 |
Correct |
15 ms |
2524 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2700 KB |
Output is correct |
| 21 |
Correct |
15 ms |
2520 KB |
Output is correct |
| 22 |
Correct |
14 ms |
2524 KB |
Output is correct |
| 23 |
Correct |
15 ms |
2528 KB |
Output is correct |
| 24 |
Correct |
14 ms |
2524 KB |
Output is correct |
