| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 491569 |
2021-12-03T10:32:06 Z |
Karabasan |
Stove (JOI18_stove) |
C++17 |
|
29 ms |
2892 KB |
#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3")
#pragma GCC optimize("unroll-loops")
int t,n,k;
int dizi[100005];
int dp[100005][5];
vector<pair<int,int> > v;
void solve()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>dizi[i];
for(int i=1;i<n;i++)
v.push_back({dizi[i+1]-dizi[i]-1,i});
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
int cevap=dizi[n]+1-dizi[1];
for(int i=0;i<k-1;i++)
cevap-=v[i].first;
cout<<cevap;
}
int main()
{
fast1
//freopen ("myfile.gir","r",stdin);
//freopen ("myfile.cik","w",stdout);
t=1;
//cin>>t;
while(t--)
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
328 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
316 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
328 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| 16 |
Correct |
20 ms |
2764 KB |
Output is correct |
| 17 |
Correct |
22 ms |
2852 KB |
Output is correct |
| 18 |
Correct |
29 ms |
2828 KB |
Output is correct |
| 19 |
Correct |
21 ms |
2744 KB |
Output is correct |
| 20 |
Correct |
25 ms |
2744 KB |
Output is correct |
| 21 |
Correct |
20 ms |
2756 KB |
Output is correct |
| 22 |
Correct |
21 ms |
2764 KB |
Output is correct |
| 23 |
Correct |
23 ms |
2892 KB |
Output is correct |
| 24 |
Correct |
21 ms |
2752 KB |
Output is correct |
