oj.uz

답안 #1033551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033551 2024-07-25T03:35:54 Z don_ban_tinh Stove (JOI18_stove) C++14
100 / 100
 20 ms 3180 KB 
#include <iostream>
#include <algorithm>

using namespace std;

#define ll long long

ll a[100100], s[100100];

int main() {
    int n, k;
    scanf("%d %d", &n, &k);

    for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);

    ll ans = a[n - 1] - a[0] + 1;
    for (int i = 0; i < n - 1; ++i) s[i] = a[i + 1] - a[i] - 1;
    sort(s, s + n - 1, greater<ll>());


    for (int i = 0; i < k - 1; ++i) ans -= s[i];
    printf("%d", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:22:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   22 |     printf("%d", ans);
      |             ~^   ~~~
      |              |   |
      |              int long long int
      |             %lld
stove.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:14:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);
      |                                 ~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 452 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 17 ms 2872 KB Output is correct
17 Correct 15 ms 2904 KB Output is correct
18 Correct 17 ms 2908 KB Output is correct
19 Correct 20 ms 3180 KB Output is correct
20 Correct 18 ms 2908 KB Output is correct
21 Correct 15 ms 2908 KB Output is correct
22 Correct 15 ms 2908 KB Output is correct
23 Correct 15 ms 2872 KB Output is correct
24 Correct 15 ms 2908 KB Output is correct