oj.uz

답안 #255010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255010 2020-07-31T03:12:59 Z shrek12357 Stove (JOI18_stove) C++14
100 / 100
 74 ms 2648 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

bool comp(int a, int b) {
	return a > b;
}
int main() {
	int n, k;
	cin >> n >> k;
	vector<int> times;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		times.push_back(temp);
	}
	sort(times.begin(), times.end());
	int tot = 1;
	vector<int> diff;
	for (int i = 1; i < times.size(); i++) {
		diff.push_back(times[i] - times[i - 1]);
		tot += times[i] - times[i - 1];
	}
	sort(diff.begin(), diff.end(), comp);
	for (int i = 0; i < k - 1; i++) {
		tot -= diff[i];
		tot++;
	}
	cout << tot << endl;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < times.size(); i++) {
                  ~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 72 ms 2408 KB Output is correct
17 Correct 73 ms 2416 KB Output is correct
18 Correct 73 ms 2648 KB Output is correct
19 Correct 71 ms 2416 KB Output is correct
20 Correct 71 ms 2412 KB Output is correct
21 Correct 71 ms 2416 KB Output is correct
22 Correct 71 ms 2412 KB Output is correct
23 Correct 74 ms 2560 KB Output is correct
24 Correct 71 ms 2412 KB Output is correct