oj.uz

답안 #1065393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065393 2024-08-19T07:00:03 Z koishi Self Study (JOI22_ho_t2) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)((x).size()))
#define pow2(x) ((ll)(x) * (x))
const ll mod = 1e9 + 7;
const int INF = 1e9 + 5; // 998244353
const ll INFF = 1e18 + 5;
// Super is the cutest girl
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<pll> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].fi;
    }
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].se;
    }
    // ll ans = INF;
    // for (int i = 0; i < n; i++)
    // {
    //     ans = min(ans, max(v[i].fi, v[i].se));
    // }
    // cout << ans << '\n';
    vl curr(n + 1, 0);
    priority_queue<pll> pq;
    for (int i = 0; i < n; i++)
    {
        pq.push({-v[i].fi, i});
    }
    for (int i = 0; i < n * m; i++)
    {
        pll u = pq.top();
        u.fi = -u.fi;
        curr[u.se] += v[u.se].fi;
        pq.pop();
        pq.push({-curr[u.se], u.se});
    }

    ll ans = INFF;
    for (int i = 0; i < n; i++)
    {
        ans = min(ans, curr[i]);
    }
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // int t; cin >> t; while(t--)
    solve();
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -