답안 #238758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238758	2020-06-12T16:29:32 Z	ignaciocanta	Stove (JOI18_stove)	C++14	100 / 100	32 ms	2432 KB

stove

#include <bits/stdc++.h>
 
using namespace std;
 
#define forsn(i, s, n) for(int i=s;i<int(n);i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define NACHO {ios::sync_with_stdio(0); cin.tie(NULL);}
 
typedef long long tint;
 
const int INF = 50000200;
const int MOD = 1e9+7;
const int N = 100001;

int dx[4] = {1,-1,0,0};
int dy[4]  = {0,0,1,-1};

bool valid(int x, int y, int n, int m){ return (0<=x && x<n && 0<=y && y<m);}

int main(){
	NACHO;
	int n, k;
	cin >> n >> k;
	vector<int> t (n);
	forn(i, n) cin >> t[i];
	vector<int> difs;
	forsn(i, 1, n) difs.push_back(t[i]-t[i-1]-1);
	sort(rall(difs));
	int tot = t.back()-t[0]+1;
	forn(i, k-1){
		tot-=difs[i];
	}
	cout << tot << "\n";
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	28 ms	2304 KB	Output is correct
17	Correct	29 ms	2432 KB	Output is correct
18	Correct	30 ms	2304 KB	Output is correct
19	Correct	28 ms	2432 KB	Output is correct
20	Correct	32 ms	2304 KB	Output is correct
21	Correct	28 ms	2432 KB	Output is correct
22	Correct	27 ms	2304 KB	Output is correct
23	Correct	29 ms	2404 KB	Output is correct
24	Correct	26 ms	2304 KB	Output is correct