제출 #921485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921485		LiuBruh	Self Study (JOI22_ho_t2)	C++17	10 / 100	48 ms	11348 KiB

Main

/***
 * Sub2: Binary Search
*/
#include <bits/stdc++.h>

#define int long long
#define sz(v) (int)v.size()
using namespace std;

const int maxn = (int)3e5 + 5;
const int INF = (int)1e18 + 5;

int n, m;
int a[maxn], b[maxn];

void sub1() {
    int mi = INF;
    for (int i = 1; i <= n; i++) {
        mi = min(mi, max(a[i], b[i]));
    }
    cout << mi << '\n';
}
void sub2() {
    
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];

    if (m == 1) sub1();
    else sub2();
}

signed main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    solve();

    return 0;
}

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