oj.uz

Submission #329826

# Submission time Handle Problem Language Result Execution time Memory
329826 2020-11-22T17:55:32 Z Sho10 Stove (JOI18_stove) C++14
100 / 100
 26 ms 3308 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,k,a[100005];
int32_t main(){
CODE_START;
cin>>n>>k;
for(ll i=1;i<=n;i++)
{
cin>>a[i];
}
vector<ll>v;
ll last=0;
for(ll i=2;i<=n;i++)
{
    v.pb(a[i]-a[i-1]);
}
sort(v.begin(),v.end());
ll ans=0;
for(ll i=0;i<n-k;i++)
{
    ans+=v[i];
}
cout<<ans+k<<endl;
}

Compilation message

stove.cpp: In function 'int32_t main()':
stove.cpp:30:4: warning: unused variable 'last' [-Wunused-variable]
   30 | ll last=0;
      |    ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 21 ms 3308 KB Output is correct
17 Correct 26 ms 3308 KB Output is correct
18 Correct 21 ms 3308 KB Output is correct
19 Correct 21 ms 3308 KB Output is correct
20 Correct 21 ms 3308 KB Output is correct
21 Correct 21 ms 3308 KB Output is correct
22 Correct 21 ms 3308 KB Output is correct
23 Correct 21 ms 3308 KB Output is correct
24 Correct 21 ms 3308 KB Output is correct