#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;
}
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 = i; 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 |
504 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 |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
440 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 |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2039 ms |
11496 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
504 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 |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
440 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 |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
11 ms |
344 KB |
Output is correct |
22 |
Correct |
11 ms |
348 KB |
Output is correct |
23 |
Correct |
12 ms |
564 KB |
Output is correct |
24 |
Correct |
16 ms |
344 KB |
Output is correct |
25 |
Correct |
11 ms |
600 KB |
Output is correct |
26 |
Correct |
12 ms |
344 KB |
Output is correct |
27 |
Correct |
13 ms |
600 KB |
Output is correct |
28 |
Correct |
19 ms |
576 KB |
Output is correct |
29 |
Correct |
13 ms |
348 KB |
Output is correct |
30 |
Correct |
13 ms |
348 KB |
Output is correct |
31 |
Correct |
14 ms |
452 KB |
Output is correct |
32 |
Correct |
14 ms |
348 KB |
Output is correct |
33 |
Correct |
14 ms |
584 KB |
Output is correct |
34 |
Correct |
14 ms |
344 KB |
Output is correct |
35 |
Correct |
14 ms |
348 KB |
Output is correct |
36 |
Correct |
21 ms |
344 KB |
Output is correct |
37 |
Correct |
15 ms |
348 KB |
Output is correct |
38 |
Correct |
20 ms |
548 KB |
Output is correct |
39 |
Correct |
19 ms |
600 KB |
Output is correct |
40 |
Correct |
16 ms |
348 KB |
Output is correct |
41 |
Correct |
17 ms |
348 KB |
Output is correct |
42 |
Correct |
17 ms |
344 KB |
Output is correct |
43 |
Correct |
17 ms |
348 KB |
Output is correct |
44 |
Correct |
17 ms |
348 KB |
Output is correct |
45 |
Correct |
17 ms |
596 KB |
Output is correct |
46 |
Correct |
21 ms |
348 KB |
Output is correct |
47 |
Correct |
18 ms |
348 KB |
Output is correct |
48 |
Correct |
18 ms |
576 KB |
Output is correct |
49 |
Correct |
18 ms |
348 KB |
Output is correct |
50 |
Correct |
19 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
504 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 |
604 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
440 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 |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Execution timed out |
2039 ms |
11496 KB |
Time limit exceeded |
22 |
Halted |
0 ms |
0 KB |
- |