Submission #155209

#	Time	Username	Problem	Language	Result	Execution time	Memory
155209		kungfulon	Stove (JOI18_stove)	C++14	100 / 100	25 ms	2236 KiB

stove

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a);i <= (b);i++)
#define repd(i,a,b) for(int i = (a);i >= (b);i--)
#define PB push_back
#define F first
#define S second
#define Task "stove"
using namespace std;
template <class T> T read(T &a){a = 0;char c = cin.get();bool nega = 0;while(!isdigit(c) && c != '-') c = cin.get();if(c == '-') nega = 1,c = cin.get();a = c - 48;c = cin.get();while(isdigit(c)) a = a * 10 + c - 48,c = cin.get();if(nega) a = -a;return a;}
template <class T> void writep(T a){if(a > 9) writep(a / 10);cout.put(a % 10 + 48);}
template <class T> void write(T a){if(a < 0) cout.put('-'),a = -a;writep(a);cout.put(' ');}
template <class T> void writeln(T a){write(a);cout.put('\n');}
const int N = 100012;
int n,k,a[N],b[N];
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//	ifstream cin (Task".inp");
//	ofstream cout (Task".out");
	cin >> n >> k;
	rep(i,1,n)
        cin >> a[i];
    rep(i,2,n) b[i] = a[i] - a[i-1] - 1;
    sort(b+2,b+n+1,greater<int>());
    int ans = a[n] - a[1] + 1;
    rep(i,2,k) ans -= b[i];
    cout << ans;
	return 0;
}

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