제출 #788630

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788630		stefanneagu	Self Study (JOI22_ho_t2)	C++17	35 / 100	1065 ms	13568 KiB

Main

#include <iostream>
#include <queue>
#define int long long

using namespace std;

const int nmax = 3e5 + 7;

int v[nmax], b[nmax];

struct pairing {
    int first, second;
    const bool operator < (pairing a) const {
        if(first != a.first) {
            return first > a.first;
        } else {
            return second > a.second;
        }
    }
};

int32_t main() {
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> v[i];
    } 
    for(int i = 1; i <= n; i ++){
        cin >> b[i];
    }
    priority_queue<pairing> pq;
    for(int i = 1; i <= n; i ++) {
        pq.push({max(v[i], b[i]), i});
    }
    for(int i = 2; i <= k; i ++) {
        for(int j = 1; j <= n; j ++) {
            int sum = pq.top().first, ind = pq.top().second;
            pq.pop();
            if(j == ind) {
                sum += max(v[j], b[j]);
            } else {
                sum +=  b[ind];
            }
            pq.push({sum, ind});
        }
    } 
    int minn = 1e18;
    while(!pq.empty()) {
        minn = min(minn, pq.top().first);
        pq.pop();
    }
    cout << minn;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9