Codeforces 1629 A. download more RAM - simple greed

This way

The question ：

Tell you at first RAM The capacity of k. Now there is n Times operation , Each calculation needs to occupy you a[i] The capacity of RAM, And after the operation, it will not occupy , I will give it to you RAM increase b[i] Point capacity . But each can only be used once .
Ask you your RAM What is the last maximum .

Answer key ：

So an obvious greed , We must be taking a The smallest first operation , Then bring it b.

#include<bits/stdc++.h>
using namespace std;
const int N=105;
struct node{
    
    int a,b;
    bool operator< (const node& aa)const {
    
        return a<aa.a;
    }
}a[N];
int main()
{
    
    int t;
    scanf("%d",&t);
    while(t--){
    
        int n,k;
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i].a);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i].b);
        sort(a+1,a+1+n);
        for(int i=1;i<=n;i++)
            if(k>=a[i].a)
                k+=a[i].b;
        printf("%d\n",k);
    }
    return 0;
}