Submission #1363423

#TimeUsernameProblemLanguageResultExecution timeMemory
1363423DangerNoodle7591Asteroid Mining (CCO25_day1problem1)C++20
8 / 25
92 ms79192 KiB
#include <bits/stdc++.h>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ins insert
#define int long long int
#define p push
#define N 1005
#define M 10005

int arr[N][2];
int dp[N][M];
int n,m;

inline int coz(int x,int kal){
    if(x>=n||kal==0)return 0;
    if(dp[x][kal]!=-1)return dp[x][kal];
    dp[x][kal]=coz(x+1,kal);
    if(arr[x][1]<=kal)dp[x][kal]=max(dp[x][kal],arr[x][0]+coz(x+1,kal-arr[x][1]));
    return dp[x][kal];
}

signed main(){
    lalala;
    memset(dp,-1,sizeof(dp));
    cin>>n>>m;
    for(int i=0;i<n;i++)cin>>arr[i][0]>>arr[i][1];
    cout<<coz(0,m)<<endl;
}


//abbsy
//dark modern
//monokai
//monokai dimmned
//tommorrow night blue
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...