Submission #1443028


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define y0 yy
#define y1 Yy
#define yn YY
#include <assert.h>
#include <algorithm>
#include <vector>
using namespace std;

int n,k,a[5005],res;
bool f[5005];

bool solve(int x){
    memset(f,false,sizeof f);
    f[0]=true;
    for(int i=0;i<n;i++)if(i!=x && a[i]<k){
        for(int j=k-1;j>=0;j--)if(f[j] && j+a[i]<k)f[j+a[i]]=true;
    }
    int curr=k;
    for(int j=0;j<k;j++)if(f[j])curr=min(curr,k-j);
    return a[x]<=curr; // Un
}

int main(){
    scanf("%d %d",&n,&k);
    for(int i=0;i<n;i++)scanf("%d",a+i);
    sort(a,a+n);
    while(n>0 && a[n-1]>=k)n--;
    int first=0,last=n-1;
    while(first<=last){
        int mid=(first+last)/2;
        if(solve(mid))first=mid+1;
        else last=mid-1;
    }
    printf("%d\n",first);
    return 0;
}

Submission Info

Submission Time
Task D - No Need
User bridgecat
Language C++14 (GCC 5.4.1)
Score 0
Code Size 896 Byte
Status WA
Exec Time 296 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
                         ^
./Main.cpp:30:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%d",a+i);
                                        ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 300
Status
AC × 3
AC × 18
WA × 8
AC × 34
WA × 17
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt WA 1 ms 256 KB
1_008.txt WA 3 ms 256 KB
1_009.txt AC 3 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt WA 3 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt WA 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt WA 1 ms 256 KB
1_021.txt WA 2 ms 256 KB
1_022.txt WA 1 ms 256 KB
1_023.txt WA 1 ms 256 KB
1_024.txt AC 2 ms 256 KB
1_025.txt AC 2 ms 256 KB
2_026.txt AC 1 ms 256 KB
2_027.txt AC 1 ms 256 KB
2_028.txt WA 1 ms 256 KB
2_029.txt WA 273 ms 256 KB
2_030.txt AC 273 ms 256 KB
2_031.txt AC 2 ms 256 KB
2_032.txt AC 2 ms 256 KB
2_033.txt AC 2 ms 256 KB
2_034.txt AC 2 ms 256 KB
2_035.txt AC 2 ms 256 KB
2_036.txt WA 296 ms 256 KB
2_037.txt AC 1 ms 256 KB
2_038.txt WA 1 ms 256 KB
2_039.txt AC 1 ms 256 KB
2_040.txt AC 2 ms 256 KB
2_041.txt WA 157 ms 256 KB
2_042.txt WA 237 ms 256 KB
2_043.txt WA 77 ms 256 KB
2_044.txt WA 93 ms 256 KB
2_045.txt WA 55 ms 256 KB
2_046.txt AC 65 ms 256 KB
2_047.txt AC 94 ms 256 KB
2_048.txt AC 117 ms 256 KB
2_049.txt AC 85 ms 256 KB
2_050.txt AC 71 ms 256 KB