Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct d{
- int x;
- int y;
- };
- bool xet(d a,d b)
- {
- return (a.y>b.y);
- }
- int main()
- {
- int n,k;
- cin>>n>>k;
- d a[n];
- for (int i=1; i<=n; i++)
- cin>>a[i].x;
- for (int i=1; i<=n; i++)
- cin>>a[i].y;
- sort(a+1,a+n+1,xet);
- int dem=0;
- for (int i=1; i<=n; i++){
- while(a[i].y>0){
- if (k-a[i].x<0) break;
- a[i].y--;
- dem++;
- k-=a[i].x;
- }
- }
- cout<<dem;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement