oj.uz

답안 #1097631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097631 2024-10-07T17:22:40 Z sax Stove (JOI18_stove) C++17
100 / 100
 33 ms 2356 KB 
#include <bits/stdc++.h>
#define int long long
///#define pragma GCC optimise("O3")

using namespace std;

signed main()
{
    int n, k; cin>>n>>k;
    vector <int> dif;
    int aux=0, all=0;
    for (int i=1; i<=n; i++)
    {
        int a; cin>>a;
        if (i>1) dif.push_back(a-aux);
        if (i==1) all=a;
        if (i==n) all=a+1-all;
        aux=a+1;
    }

    sort(dif.begin(), dif.end(), greater<int>());

    k--;
    for (auto x:dif)
    {
        if (k==0) break;
        k--;
        all-=x;
    }
    cout<<all<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 348 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 448 KB Output is correct
12 Correct 1 ms 492 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 348 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 448 KB Output is correct
12 Correct 1 ms 492 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 33 ms 2356 KB Output is correct
17 Correct 31 ms 2232 KB Output is correct
18 Correct 32 ms 2252 KB Output is correct
19 Correct 31 ms 2260 KB Output is correct
20 Correct 31 ms 2260 KB Output is correct
21 Correct 30 ms 2260 KB Output is correct
22 Correct 31 ms 2256 KB Output is correct
23 Correct 31 ms 2260 KB Output is correct
24 Correct 31 ms 2260 KB Output is correct