Submission #886536

# Submission time Handle Problem Language Result Execution time Memory
886536 2023-12-12T09:45:17 Z vjudge1 Gym Badges (NOI22_gymbadges) C++17
42 / 100
259 ms 9664 KB
#include <bits/stdc++.h>
using namespace std;
#define tol(bi) (1ll<<((int)(bi)))
int main(){
	int n;
	cin>>n;
	vector<pair<int,int>> arr(n);
	for (int i = 0; i < n; ++i)
	{
		cin>>arr[i].second;
	}
	for (int i = 0; i < n; ++i)
	{
		cin>>arr[i].first;
	}
	if (n>5000){
		cout<<"NO"<<endl;
		return 0;
	}
	sort(arr.begin(), arr.end(), [&](pair<int,int> a, pair<int,int> b){
		return (a.first+a.second)<(b.first+b.second);
	});
	vector<int> val(n+1,-1);
	val[0]=0;
	for (int i = 0; i < n; i++){
		for (int j = n-1; j >= 0; j--){
			if (val[j]==-1) continue;
			if (val[j]<=arr[i].first){
				if (val[j+1]==-1) val[j+1]=val[j]+arr[i].second;
				val[j+1]=min(val[j+1],val[j]+arr[i].second);
			}
		}
	}
	for (int i = n; i >= 0; i--){
		if (val[i]!=-1){
			cout<<i<<endl;
			break;
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 259 ms 9664 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 22 ms 344 KB Output is correct
22 Correct 23 ms 348 KB Output is correct
23 Correct 23 ms 348 KB Output is correct
24 Correct 44 ms 348 KB Output is correct
25 Correct 35 ms 344 KB Output is correct
26 Correct 36 ms 348 KB Output is correct
27 Correct 38 ms 600 KB Output is correct
28 Correct 44 ms 348 KB Output is correct
29 Correct 40 ms 344 KB Output is correct
30 Correct 41 ms 348 KB Output is correct
31 Correct 45 ms 348 KB Output is correct
32 Correct 44 ms 348 KB Output is correct
33 Correct 42 ms 348 KB Output is correct
34 Correct 46 ms 564 KB Output is correct
35 Correct 45 ms 344 KB Output is correct
36 Correct 44 ms 348 KB Output is correct
37 Correct 43 ms 348 KB Output is correct
38 Correct 43 ms 548 KB Output is correct
39 Correct 43 ms 552 KB Output is correct
40 Correct 45 ms 348 KB Output is correct
41 Correct 42 ms 600 KB Output is correct
42 Correct 43 ms 344 KB Output is correct
43 Correct 42 ms 348 KB Output is correct
44 Correct 42 ms 348 KB Output is correct
45 Correct 42 ms 556 KB Output is correct
46 Correct 45 ms 548 KB Output is correct
47 Correct 42 ms 548 KB Output is correct
48 Correct 33 ms 544 KB Output is correct
49 Correct 41 ms 544 KB Output is correct
50 Correct 42 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 259 ms 9664 KB Output isn't correct
22 Halted 0 ms 0 KB -