| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 223721 |
2020-04-16T08:04:13 Z |
bharat2002 |
Stove (JOI18_stove) |
C++14 |
|
29 ms |
3064 KB |
/*input
3 2
1
3
6
*/
#include<bits/stdc++.h>
using namespace std;
const int N=1e5 + 100;
const int mod=1e9 + 7;
#define int long long
const int inf=1e18;
#define pii pair<int, int>
#define f first
#define s second
#define mp make_pair
#define FOR(i, n) for(int i=1;i<=n;i++)
#define TRACE(x) cerr << #x << " = " << x << endl
//Trace prints the name of the variable and the value.
int ans, arr[N];vector<int> vals;
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n, k;cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>arr[i];
if(i>1) vals.push_back(arr[i]-arr[i-1]);
}
sort(vals.begin(), vals.end());
ans=n;
for(int i=0;i<n-k;i++)
{
ans+=vals[i]-1;
}
cout<<ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
640 KB |
Output is correct |
| 11 |
Correct |
5 ms |
512 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
512 KB |
Output is correct |
| 15 |
Correct |
5 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
640 KB |
Output is correct |
| 11 |
Correct |
5 ms |
512 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
512 KB |
Output is correct |
| 15 |
Correct |
5 ms |
512 KB |
Output is correct |
| 16 |
Correct |
27 ms |
3064 KB |
Output is correct |
| 17 |
Correct |
29 ms |
3064 KB |
Output is correct |
| 18 |
Correct |
27 ms |
3064 KB |
Output is correct |
| 19 |
Correct |
27 ms |
3064 KB |
Output is correct |
| 20 |
Correct |
27 ms |
3064 KB |
Output is correct |
| 21 |
Correct |
28 ms |
3064 KB |
Output is correct |
| 22 |
Correct |
28 ms |
3064 KB |
Output is correct |
| 23 |
Correct |
28 ms |
3056 KB |
Output is correct |
| 24 |
Correct |
27 ms |
3064 KB |
Output is correct |
