제출 #922752

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922752		SuPythony	Self Study (JOI22_ho_t2)	C++17	62 / 100	1053 ms	15296 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n,m; cin>>n>>m;
    vector<ll> a(n), b(n);
    for (auto &i: a) cin>>i;
    for (int i=0; i<n; i++) {
        cin>>b[i];
        a[i]=max(a[i],b[i]);
        
    }
    priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> q;
    for (int i=0; i<n; i++) q.push({0ll,i});
    vector<int> times(n,0);
    for (int i=0; i<n*m; i++) {
        auto t=q.top(); q.pop();
        if (times[t.second]<m) {
            t.first+=a[t.second];
            times[t.second]++;
        } else {
            t.first+=b[t.second];
        }
        q.push(t);
    }
    cout<<q.top().first;
    return 0;   
}

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