Submission #922748

#TimeUsernameProblemLanguageResultExecution timeMemory
922748SuPythonySelf Study (JOI22_ho_t2)C++17
35 / 100
1031 ms15208 KiB
#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++) {
        for (int i=0; i<n; i++) {
            auto t=q.top(); q.pop();
            if (i==t.second) {
                t.first+=max(a[i],b[i]);
            } else {
                t.first+=b[t.second];
            }
            q.push(t);
        }
    }
    cout<<q.top().first;
    return 0;   
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...