제출 #665845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
665845		Bogdan1110	Stove (JOI18_stove)	C++14	100 / 100	22 ms	2648 KiB

stove

#include <bits/stdc++.h>
#define FAST {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define FILES {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
#define ll long long
#define ull unsigned long long
#define pqueue priority_queue
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(a) (a).begin(), (a).end()
#define mp make_pair 
#define vii vector<int>
#define vll vector<long long>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>
*/
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element                                          

const double eps = 0.00000001;
const int NMAX = 200010;
const ll inf = 1000000000000010;
const ll modi = 15485863 ;



void solve() {
	int n,k;
	cin >>n >>k;
	vector<ll>v(n);
	for (int i = 0 ; i < n ; i++ ) {
		cin >> v[i];
	}		
	ll tot = n;
	pqueue<int>pq;
	for (int i = 1 ; i < n ; i++ ) {
		pq.push(-v[i]+v[i-1]+1);
	}
	
	for (int i = 0 ; i < n-k; i++ ) {
		tot -= pq.top();
		pq.pop();
	}
	cout << tot <<endl;
}

int main () {
    FAST
    int t=1;

    /*
    cin >> t;
    //*/

    int i = 1;
    while(t--) {
        //cout << "Case " << i++ << ": " ;
        solve();
    }
}      

컴파일 시 표준 에러 (stderr) 메시지

stove.cpp: In function 'int main()':
stove.cpp:64:9: warning: unused variable 'i' [-Wunused-variable]
   64 |     int i = 1;
      |         ^

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