58672023-10-04 17:23:02CWMVállalkozócpp17Accepted 40/4026ms3984 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;
	vector<int> capacity(n);
	vector<int> dueToDayN(n);
	int res = 0;
	for (size_t i = 0; i < n; i++)
	{
		cin >> capacity[i];
	}
	for (size_t i = 0; i < m; i++)
	{
		int a; 
		cin >> a;
		dueToDayN[a-1]++;
	}
	int plus = 0;
	for (size_t i = 0; i < n; i++)
	{
		plus += capacity[i];
		plus -= dueToDayN[i];
		if (plus >= 0) {
			res += dueToDayN[i];
		}
		else {
			res += dueToDayN[i] + plus;
			plus = 0;
		}
	}
	cout << res;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1684 KiB
2Accepted0/026ms1940 KiB
3Accepted2/23ms2088 KiB
4Accepted2/22ms2144 KiB
5Accepted2/22ms2276 KiB
6Accepted2/23ms2392 KiB
7Accepted2/24ms2636 KiB
8Accepted2/23ms2872 KiB
9Accepted2/24ms3060 KiB
10Accepted2/23ms3148 KiB
11Accepted2/23ms3268 KiB
12Accepted2/23ms3272 KiB
13Accepted2/24ms3400 KiB
14Accepted2/24ms3480 KiB
15Accepted2/29ms3612 KiB
16Accepted2/28ms3652 KiB
17Accepted2/214ms3984 KiB
18Accepted2/210ms3908 KiB
19Accepted2/213ms3904 KiB
20Accepted2/214ms3840 KiB
21Accepted2/218ms3948 KiB
22Accepted2/226ms3968 KiB