Submission #891649

#TimeUsernameProblemLanguageResultExecution timeMemory
89164912345678Self Study (JOI22_ho_t2)C++17
0 / 100
1 ms2396 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=3e5+5; ll n, m, a[nx], b[nx]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; for (int i=1; i<=n; i++) cin>>a[i]; for (int i=1; i<=n; i++) cin>>b[i], pq.push({0, i}); for (int i=1; i<=n*m; i++) { auto [x, idx]=pq.top(); pq.pop(); pq.push({x+a[idx], idx}); } cout<<pq.top().first; }
#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...