제출 #973740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973740		Bilal_Coder	은행 (IZhO14_bank)	C++17	0 / 100	1 ms	348 KiB

bank

/*
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n , m;
    scanf("%d %d" , &n , &m);
    vector<int> a(n) , b(m);
    for (auto & x : a)scanf("%d" , &x);
    for (auto & x : b)scanf("%d" , &x);
    for (auto x : a){
        bool flag = false;
        for (int mask = 0; mask < (1 << m); mask++){
            int sum = 0;

            for (int i = 0; i < m; i++)
                if (mask & (1 << i))sum += b[i];

            if (sum == x){
                flag = true;
                break;
            }
        }
        if (!flag){
            puts("nO");
            return 0;
        }
    }
    puts("YES");
}*/
#include <bits/stdc++.h>
using namespace std;
string solve(int n, int m, vector<int>& a, vector<int>& b) {
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (int i = 0; i < n; i++) {
        int ind = -1;
        for (int j = 0; j < m; j++) {
            if (b[j] <= a[i]) {
                ind = j;
            } else {
                break;
            }
        }
        if (ind == -1) {
            return "nO";
        }
        b.erase(b.begin() + ind);
        m--;
    }
    return "YES";
}
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    vector<int> b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    cout << solve(n, m, a, b) << endl;

    return 0;
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29