Submission #176085

# Submission time Handle Problem Language Result Execution time Memory
176085 2020-01-07T20:47:08 Z awlintqaa Stove (JOI18_stove) C++14
100 / 100
85 ms 3308 KB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
ll n,k;
ll a[100009];
int main(){
        cin>>n>>k;
        for(int i=0;i<n;i++)cin>>a[i];
        vll v;
        ll sum=1;
        for(int i=1;i<n;i++)v.pb(a[i]-a[i-1]),sum+=a[i]-a[i-1];
        sort(v.begin(),v.end());
        k--;
        ll j=v.size()-1;
        while(k--){
                sum-=v[j--]-1;
        }
        cout<<sum<<endl;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 128 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 128 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 128 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 85 ms 3276 KB Output is correct
17 Correct 85 ms 3300 KB Output is correct
18 Correct 85 ms 3184 KB Output is correct
19 Correct 85 ms 3184 KB Output is correct
20 Correct 85 ms 3308 KB Output is correct
21 Correct 85 ms 3184 KB Output is correct
22 Correct 84 ms 3184 KB Output is correct
23 Correct 84 ms 3184 KB Output is correct
24 Correct 84 ms 3284 KB Output is correct