oj.uz

답안 #1033662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033662 2024-07-25T04:11:30 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 22 ms 1504 KB 
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define ins insert
#define pf push_front
#define bit(n,k) ((n>>k)&1) 
#define pi acos(-1.0)
const ll N=2e5+5, inf = 1e9, mod=1e9+7;
using namespace std;
bool cmp(ii a, ii b){
    return a>b;
}
int main(){
    // freopen("TRAVEL.INP", "r", stdin);
    // freopen("TRAVEL.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);  
    ii n,k; cin >> n >> k;
    ii a[n+1];
    vector<ii>v;
    for(ii i=1;i<=n;i++) cin >> a[i];
    for(ii i=2;i<=n;i++) v.pb(a[i]-a[i-1]-1);
    sort(v.begin(),v.end(),cmp);
    ii ans=a[n]-a[1]+1;
    for(ii i=0;i<k-1;i++) ans-=v[i];
    cout << ans << endl; 
}

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 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 348 KB Output is correct
8 Correct 1 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 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 348 KB Output is correct
8 Correct 1 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 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 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 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 348 KB Output is correct
8 Correct 1 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 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 17 ms 1484 KB Output is correct
17 Correct 15 ms 1504 KB Output is correct
18 Correct 15 ms 1504 KB Output is correct
19 Correct 16 ms 1248 KB Output is correct
20 Correct 18 ms 1484 KB Output is correct
21 Correct 15 ms 1504 KB Output is correct
22 Correct 15 ms 1504 KB Output is correct
23 Correct 22 ms 1504 KB Output is correct
24 Correct 15 ms 1504 KB Output is correct