oj.uz

답안 #863115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863115 2023-10-19T15:33:17 Z efedmrlr Stove (JOI18_stove) C++17
100 / 100
 21 ms 3292 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e17+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,k;

vector<int> t;
vector<int> itrs;

inline void solve() {
    cin>>n>>k;
    t.resize(n);
    for(int i = 0; i<n; i++) {
        cin>>t[i];
    }
    sort(t.begin(), t.end());
    int tot = t.back() + 1 - t[0];
    for(int i = 1 ;i<n; i++) {
        itrs.pb(t[i] - t[i-1] - 1);
    }

    sort(itrs.begin(), itrs.end());
    
    for(int i = 0; i<k-1; i++) {
        tot -= itrs.back();
        itrs.pop_back();
    }
    cout<<tot<<"\n";
}
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

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 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 344 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 348 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 388 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 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 344 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 348 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 388 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 16 ms 3292 KB Output is correct
17 Correct 16 ms 3280 KB Output is correct
18 Correct 16 ms 3288 KB Output is correct
19 Correct 16 ms 3292 KB Output is correct
20 Correct 21 ms 3284 KB Output is correct
21 Correct 16 ms 3292 KB Output is correct
22 Correct 21 ms 3288 KB Output is correct
23 Correct 17 ms 3288 KB Output is correct
24 Correct 15 ms 3292 KB Output is correct