Submission #456244


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pr;


int N,P;
int a[5000],b[5000];
int dp[5001];

int main(){
    scanf("%d%d",&N,&P);

    vector<pr>V;
    for(int i=0;i<N;i++){
        int _a,_b;scanf("%d%d",&_a,&_b);
        V.push_back(pr(_a,_b));
    }
    sort(V.rbegin(),V.rend());

    for(int i=0;i<N;i++){
        a[i]=V[i].first;
        b[i]=V[i].second;
    }

    int ma=0;
    for(int i=0;i<N;i++){
        for(int j=P;j>=0;j--){
            if(j+a[i]>P)continue;
            dp[j+a[i]]=max(dp[j+a[i]],dp[j]+b[i]);
        }
        if(i+1!=N)ma=max(ma,dp[P]+b[i+1]);
    }
    printf("%d\n",max(ma,dp[P]));
    return 0;
}

Submission Info

Submission Time
Task C - おやつ
User latte0119
Language C++ (GCC 4.9.2)
Score 100
Code Size 693 Byte
Status AC
Exec Time 100 ms
Memory 1052 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&P);
                        ^
./Main.cpp:15:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int _a,_b;scanf("%d%d",&_a,&_b);
                                        ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 17
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 27 ms 800 KB
sample_02.txt AC 26 ms 748 KB
sample_03.txt AC 25 ms 920 KB
subtask1_00.txt AC 27 ms 928 KB
subtask1_01.txt AC 26 ms 916 KB
subtask1_02.txt AC 26 ms 800 KB
subtask1_03.txt AC 27 ms 920 KB
subtask1_04.txt AC 27 ms 800 KB
subtask1_05.txt AC 27 ms 800 KB
subtask1_06.txt AC 27 ms 800 KB
subtask1_07.txt AC 26 ms 924 KB
subtask1_08.txt AC 28 ms 924 KB
subtask1_09.txt AC 26 ms 928 KB
subtask1_10.txt AC 26 ms 800 KB
subtask1_11.txt AC 26 ms 804 KB
subtask1_12.txt AC 26 ms 800 KB
subtask1_13.txt AC 25 ms 924 KB
subtask1_14.txt AC 27 ms 916 KB
subtask2_00.txt AC 31 ms 916 KB
subtask2_01.txt AC 38 ms 732 KB
subtask2_02.txt AC 76 ms 860 KB
subtask2_03.txt AC 32 ms 924 KB
subtask2_04.txt AC 41 ms 1052 KB
subtask2_05.txt AC 63 ms 916 KB
subtask2_06.txt AC 27 ms 732 KB
subtask2_07.txt AC 31 ms 916 KB
subtask2_08.txt AC 26 ms 924 KB
subtask2_09.txt AC 37 ms 792 KB
subtask2_10.txt AC 95 ms 928 KB
subtask2_11.txt AC 97 ms 920 KB
subtask2_12.txt AC 96 ms 1048 KB
subtask2_13.txt AC 96 ms 932 KB
subtask2_14.txt AC 95 ms 928 KB
subtask2_15.txt AC 96 ms 928 KB
subtask2_16.txt AC 98 ms 1048 KB
subtask2_17.txt AC 100 ms 984 KB
subtask2_18.txt AC 97 ms 1052 KB
subtask2_19.txt AC 98 ms 932 KB