제출 #736342

#제출 시각아이디문제언어결과실행 시간메모리
736342oyberStove (JOI18_stove)C++14
100 / 100
24 ms1884 KiB
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

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

    vector<int> diffs;
    int before = 0;
    int first = 0;
    for (int i = 0; i < n; i++) {
        int t;
        scanf("%d", &t);

        if (i != 0) {
            int diff = t-before-1;
            diffs.push_back(-diff);
        } else {
            first = t;
        }
        before = t;
    }

    sort(diffs.begin(), diffs.end());

    int wait = before-first+1;
    for (int i = 0; i < k-1; i++) {
        wait += diffs[i];
    }
    printf("%d\n", wait);
}

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

stove.cpp: In function 'int main()':
stove.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", &t);
      |         ~~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...