oj.uz

답안 #1049696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049696 2024-08-09T04:17:15 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 45 ms 5500 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;

#define ll long long

int n,k,a[100001],ans=0;
multiset<int> ma;
      
int main(){
      cin>>n>>k;
      for(int i=0;i<n;i++){
            cin>>a[i];
            if(i>0){
                  ma.insert(-(a[i]-a[i-1]-1));
            }
      }
      ans=a[n-1]-a[0]+1;
      int ck=1;
      for(auto it : ma){
            if(ck>=k)break;
            ck++;
            ans+=it;
      }
      cout<<ans<<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 1 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 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 1 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 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 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 592 KB Output is correct
15 Correct 1 ms 344 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 1 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 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 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 592 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 39 ms 5468 KB Output is correct
17 Correct 41 ms 5312 KB Output is correct
18 Correct 40 ms 5460 KB Output is correct
19 Correct 41 ms 5460 KB Output is correct
20 Correct 42 ms 5500 KB Output is correct
21 Correct 39 ms 5320 KB Output is correct
22 Correct 42 ms 5496 KB Output is correct
23 Correct 42 ms 5456 KB Output is correct
24 Correct 45 ms 5468 KB Output is correct