제출 #1179379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1179379		aguss	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long delivery(int N, int K, int l, int p[]) {
    ll ans = 0, L = l;
    vector<ll> arr(N);
    for(int i = 0; i < N; i++){
        arr[i] = (ll)p[i];
    }
    sort(arr.rbegin(), arr.rend());
    const auto [mi, ma] = minmax_element(arr.begin(), arr.end());
    if(*mi > L / 2){
        ans = (L - *mi) * 2ll; 
    } else if(*ma < (L + 1) / 2){
        ans = *ma * 2ll;
    } else ans = L;
    return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30