58262023-10-02 22:03:07TuruTamasVállalkozócpp17Accepted 40/4018ms5080 KiB
#include "bits/stdc++.h"
#include <algorithm>
#include <ios>
#include <vector>
using namespace std;

int N, M;
vector<int> telj;
vector<int> hata;

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(M);
    for (int i = 0; i < M; i++) {
        cin >> hata[i];
        hata[i]--;
    }
    sort(hata.begin(), hata.end());
    int t = 0, i = 0, r = 0;
    for (int h : hata) {
        if (i == telj[t]) {
            i = 0;
            t++;
            while (telj[t] == 0) t++;
        }
        if (h >= t) {
            i++;
            r++;
        }
    }
    cout << r << endl;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1768 KiB
2Accepted0/018ms2796 KiB
3Accepted2/23ms2204 KiB
4Accepted2/23ms2356 KiB
5Accepted2/23ms2576 KiB
6Accepted2/23ms2936 KiB
7Accepted2/23ms3152 KiB
8Accepted2/23ms3096 KiB
9Accepted2/23ms3096 KiB
10Accepted2/23ms3084 KiB
11Accepted2/23ms3348 KiB
12Accepted2/23ms3556 KiB
13Accepted2/24ms3764 KiB
14Accepted2/23ms3712 KiB
15Accepted2/27ms3948 KiB
16Accepted2/27ms4076 KiB
17Accepted2/28ms4352 KiB
18Accepted2/26ms4384 KiB
19Accepted2/27ms4380 KiB
20Accepted2/210ms4604 KiB
21Accepted2/214ms4688 KiB
22Accepted2/218ms5080 KiB