oj.uz

Submission #874946

# Submission time Handle Problem Language Result Execution time Memory
874946 2023-11-18T07:38:05 Z hugsfromadicto Knapsack (NOI18_knapsack) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+5;
bool dp[MAXN+1];
#define int long long
signed main(){
    int sum;
    cin>>sum;
    int t;
    dp[0]=true;
    while(cin>>t)
    {
        for(int i=sum;i>=t;i--)
        {
            if(dp[i-t]==true)
            {
                dp[i]=true;
            }
        }
           
    }
    for(int i=sum;i>=0;i--)
    {
        if(dp[i]==true)
        {
            cout<<i;
            return 0;
        }
    }
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -