# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
203524 |
2020-02-21T05:49:06 Z |
SoGood |
Stove (JOI18_stove) |
C++14 |
|
77 ms |
2424 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5 , mod = 1e9 +7 ;
long long n , m;
int main()
{
cin>>n>>m ;
long long l = 0 , t;
vector<long long > v;
for(int i = 0 ; i<n ; i++)
{
cin>>t;
if(i)
{
v.push_back( t - l -1 );
}
l = t;
}
long long k = 0;
sort(v.begin() , v.end());
for(int i = 0;i<n - m ;i++)
k+=v[i];
cout<< n+k;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
256 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
256 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
10 |
Correct |
7 ms |
380 KB |
Output is correct |
11 |
Correct |
7 ms |
376 KB |
Output is correct |
12 |
Correct |
7 ms |
376 KB |
Output is correct |
13 |
Correct |
7 ms |
376 KB |
Output is correct |
14 |
Correct |
7 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
256 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
10 |
Correct |
7 ms |
380 KB |
Output is correct |
11 |
Correct |
7 ms |
376 KB |
Output is correct |
12 |
Correct |
7 ms |
376 KB |
Output is correct |
13 |
Correct |
7 ms |
376 KB |
Output is correct |
14 |
Correct |
7 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
16 |
Correct |
74 ms |
2412 KB |
Output is correct |
17 |
Correct |
74 ms |
2420 KB |
Output is correct |
18 |
Correct |
75 ms |
2340 KB |
Output is correct |
19 |
Correct |
74 ms |
2416 KB |
Output is correct |
20 |
Correct |
77 ms |
2412 KB |
Output is correct |
21 |
Correct |
75 ms |
2412 KB |
Output is correct |
22 |
Correct |
75 ms |
2424 KB |
Output is correct |
23 |
Correct |
77 ms |
2416 KB |
Output is correct |
24 |
Correct |
75 ms |
2420 KB |
Output is correct |