58802023-10-04 17:51:41TheDrunkFoxVállalkozócpp11Accepted 40/4027ms4156 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int a, b, IN, work = 0, worked = 0, wanttowork;
	cin >> a >> b;
	vector<int> works(0),tobeworked(a);
	for(int i = 0; i != a; i++){
		cin >> IN;
		works.push_back(IN);
	}
	for(int i = 0; i != b; i++){
		cin >> IN;
		tobeworked[IN-1]++;
	}
	for(int i = 0; i != a; i++){
		work += works[i];
		wanttowork = tobeworked[i];
		if(wanttowork > work){
			worked += work;
			work = 0;
		}
		else{
			work += -wanttowork;
			worked += wanttowork;
		}
	}
	cout << worked;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1680 KiB
2Accepted0/027ms1940 KiB
3Accepted2/23ms2168 KiB
4Accepted2/23ms2380 KiB
5Accepted2/23ms2548 KiB
6Accepted2/23ms2588 KiB
7Accepted2/24ms2724 KiB
8Accepted2/23ms2944 KiB
9Accepted2/24ms3036 KiB
10Accepted2/23ms3252 KiB
11Accepted2/23ms3332 KiB
12Accepted2/23ms3460 KiB
13Accepted2/24ms3676 KiB
14Accepted2/24ms3788 KiB
15Accepted2/28ms3764 KiB
16Accepted2/29ms3764 KiB
17Accepted2/214ms4024 KiB
18Accepted2/210ms4028 KiB
19Accepted2/213ms4156 KiB
20Accepted2/214ms3984 KiB
21Accepted2/219ms3984 KiB
22Accepted2/226ms3984 KiB