제출 #1288254

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288254		muhammad-mutahir	Stove (JOI18_stove)	C++20	0 / 100	0 ms	568 KiB

stove

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e6+3;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>k;
    input(int,l,n);

    vector<int>ran;
    for(int i = 0;i+1<n;i++){
    	ran.pb(l[i+1]-l[i]);
    }
    // sort(all(ran));
    // for(auto i:ran){
    	// print(i);
    // }
    k--;
    int ans = l[n-1]-l[0]+1;
    while(k and ran.size()){
    	ans-=ran.back()-1;
    	ran.pop_back();
    	k-=1;
    }
    cout<<ans<<endl;

}







signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);
    
    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50