Submission #922749

#	Time	Username	Problem	Language	Result	Execution time	Memory
922749		SuPythony	Self Study (JOI22_ho_t2)	C++17	35 / 100	1035 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 (auto &i: b) cin>>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});
    for (int j=0; j<m; j++) {
        vector<int> days(n,0);
        for (int i=0; i<n; i++) {
            auto t=q.top(); q.pop();
            if (days[t.second]==0) {
                t.first+=max(a[t.second],b[t.second]);
                days[t.second]=1;
            } 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: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9