oj.uz

답안 #967814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967814 2024-04-22T23:40:46 Z vjudge1 Stove (JOI18_stove) C++17
0 / 100
 0 ms 504 KB 
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;
using ll = long long;

int main()
{
    priority_queue<ll> pq;
    int n, k;
    long long pre, curr, ans; scanf("%d %d %lld", &n, &k, &pre); ans = pre;
    if (n == k) return printf("0"), 0;
    for (int i = 1;i < n;i++){
        scanf("%lld", &curr);
        pq.push(curr-pre-1);
        pre = curr;
    }
    ans = curr-ans+1;
    while (--k){
        ans -= pq.top();
        pq.pop();
    }
    printf("%lld", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:13:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     long long pre, curr, ans; scanf("%d %d %lld", &n, &k, &pre); ans = pre;
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%lld", &curr);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 504 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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 504 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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 504 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 344 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -