59732023-10-07 15:48:40TuruTamasVállalkozócpp17Accepted 40/4012ms3860 KiB
#include "bits/stdc++.h"
#include <algorithm>
#include <ios>
#include <vector>
using namespace std;

int N, M;
vector<int> telj;
vector<int> hata;
int r = 0, a;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> M;
    telj.resize(N);
    for (int i = 0; i < N; i++) {
        cin >> telj[i];
    }
    hata.resize(N);
    for (int i = 0; i < M; i++) {
        cin >> a;
        hata[a-1]++;
    }
    int i = 0, j = 0;
    while (i != N && j != N) {
        while (i < N && telj[i] == 0) i++;
        while (j < N && hata[j] == 0) j++;
        if (i > j) {
            j++;
            continue;
        }
        if (j >= N) break;
        hata[j]--;
        telj[i]--;
        r++;
    }
    cout << r << endl;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1892 KiB
2Accepted0/012ms2028 KiB
3Accepted2/22ms2100 KiB
4Accepted2/23ms2232 KiB
5Accepted2/22ms2456 KiB
6Accepted2/23ms2628 KiB
7Accepted2/23ms2832 KiB
8Accepted2/23ms3044 KiB
9Accepted2/23ms3256 KiB
10Accepted2/23ms3340 KiB
11Accepted2/23ms3564 KiB
12Accepted2/23ms3548 KiB
13Accepted2/23ms3684 KiB
14Accepted2/23ms3768 KiB
15Accepted2/24ms3768 KiB
16Accepted2/24ms3764 KiB
17Accepted2/27ms3836 KiB
18Accepted2/26ms3840 KiB
19Accepted2/26ms3860 KiB
20Accepted2/27ms3788 KiB
21Accepted2/28ms3772 KiB
22Accepted2/212ms3772 KiB