Submission #1170947


Source Code Expand

#include<stdio.h>

void QSort(int x[ ], int left, int right);
void Swap(int x[ ], int i, int j);
void reverse(int array[], int length);

void QSort(int x[ ], int left, int right)
{
    int i, j;
    int pivot;
    i = left;                      
    j = right;
    pivot = x[(left + right) / 2]; 
    while (1) {                    
        while (x[i] < pivot)       
            i++;

        while (pivot < x[j])       
            j--;                 
        if (i >= j)              
            break;              

        Swap(x, i, j);            
        i++;                       
        j--;
    }
    
    if (left < i - 1)              
        QSort(x, left, i - 1);    
    if (j + 1 <  right)            
        QSort(x, j + 1, right);    
}

void Swap(int x[ ], int i, int j)
{
    int temp;
    temp = x[i];
    x[i] = x[j];
    x[j] = temp;
}

void reverse(int array[], int length)
{
    int i, j;
    int temp;
    
    for( i = 0, j = length - 1; i < j; i++, j-- )
    {
        temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }
}

int main (void) {
  int N,K;
  scanf("%d %d",&N,&K);
  int a[5010];
  int i,j;
  for(i=0;i<N;i++){
    scanf("%d",&a[i]);
    if(a[i]>=5000){
      N--;
      i--;
    }
  }

  QSort(a, 0, N-1);
  reverse(a,N);

  int left,right,point;
  int sum;
  int check = 0;
  point = -1;
  for(left=0;left<N;left++){
    sum = 0;
    for(right=left;right<N;right++){
      sum += a[right];
      if(sum>=K){
	point = right;
	sum -= a[right];
      } else {
	if(right==N-1){
	  //check = 1;
	}
      }
    }
    if(check){
      break;
    }
  }
  
  printf("%d\n",N-point-1);

  return 0;
}

Submission Info

Submission Time
Task D - No Need
User shar18
Language C (GCC 5.4.1)
Score 600
Code Size 1764 Byte
Status AC
Exec Time 22 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:57:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&N,&K);
   ^
./Main.c:61:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&a[i]);
     ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 300 / 300
Status
AC × 3
AC × 26
AC × 51
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 0 ms 128 KB
0_001.txt AC 1 ms 128 KB
0_002.txt AC 1 ms 128 KB
1_003.txt AC 1 ms 128 KB
1_004.txt AC 0 ms 128 KB
1_005.txt AC 1 ms 128 KB
1_006.txt AC 1 ms 128 KB
1_007.txt AC 1 ms 128 KB
1_008.txt AC 1 ms 128 KB
1_009.txt AC 1 ms 128 KB
1_010.txt AC 1 ms 128 KB
1_011.txt AC 1 ms 128 KB
1_012.txt AC 1 ms 128 KB
1_013.txt AC 1 ms 128 KB
1_014.txt AC 1 ms 128 KB
1_015.txt AC 1 ms 128 KB
1_016.txt AC 1 ms 128 KB
1_017.txt AC 1 ms 128 KB
1_018.txt AC 1 ms 128 KB
1_019.txt AC 1 ms 128 KB
1_020.txt AC 1 ms 128 KB
1_021.txt AC 1 ms 128 KB
1_022.txt AC 1 ms 128 KB
1_023.txt AC 1 ms 128 KB
1_024.txt AC 1 ms 128 KB
1_025.txt AC 1 ms 128 KB
2_026.txt AC 1 ms 128 KB
2_027.txt AC 1 ms 128 KB
2_028.txt AC 1 ms 128 KB
2_029.txt AC 21 ms 128 KB
2_030.txt AC 21 ms 128 KB
2_031.txt AC 1 ms 128 KB
2_032.txt AC 1 ms 128 KB
2_033.txt AC 1 ms 128 KB
2_034.txt AC 1 ms 128 KB
2_035.txt AC 22 ms 128 KB
2_036.txt AC 22 ms 128 KB
2_037.txt AC 1 ms 128 KB
2_038.txt AC 1 ms 128 KB
2_039.txt AC 1 ms 128 KB
2_040.txt AC 1 ms 128 KB
2_041.txt AC 22 ms 128 KB
2_042.txt AC 22 ms 128 KB
2_043.txt AC 4 ms 128 KB
2_044.txt AC 8 ms 128 KB
2_045.txt AC 7 ms 128 KB
2_046.txt AC 21 ms 128 KB
2_047.txt AC 21 ms 128 KB
2_048.txt AC 21 ms 128 KB
2_049.txt AC 22 ms 128 KB
2_050.txt AC 21 ms 128 KB