Submission #922746

#TimeUsernameProblemLanguageResultExecution timeMemory
922746SuPythonySelf Study (JOI22_ho_t2)C++17
25 / 100
1082 ms14528 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 i=0; i<n*m; i++) {
        auto t=q.top(); q.pop();
        q.push({t.first+b[t.second],t.second});
    }
    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...