제출 #891650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891650		12345678	Self Study (JOI22_ho_t2)	C++17	25 / 100	1089 ms	15304 KiB

Main

#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<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> 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;
}

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