Submission #1495339


Source Code Expand

#include <stdio.h>

void quicksort(int a[], int low, int high) {
  if(high <= low)
    return;
  
    int x = a[low];
    int i = low;
    int j = high;
    int w;

    while(i <= j) {
      while(a[i] < x) {
	i++;
      }
      while(a[j] > x) {
	j--;
      }
      if(i <= j) {
	w = a[i];
	a[i] = a[j];
	a[j] = w;
	i++;
	j--;
      }
    }
    quicksort(a, low, j);
    quicksort(a, i, high);
    return;
}
  

int main(void) {
  int n, k, i;
  int r[100];
  double rate = 0;
  scanf("%d %d", &n, &k);
  for(i = 0; i < n; i++) {
    scanf("%d", &r[i]);
  }

  quicksort(r, 0, n-1);

  for(i = n-k; i < n; i++) {
    rate = (rate + r[i]) / 2;
  }

  printf("%f\n", rate);
  return(0);
}

Submission Info

Submission Time
Task C - AtCoderプログラミング講座
User forestelements
Language C (GCC 5.4.1)
Score 100
Code Size 736 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:37:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &k);
   ^
./Main.c:39:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &r[i]);
     ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 34
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 0 ms 128 KB
00_sample_02.txt AC 0 ms 128 KB
00_sample_03.txt AC 0 ms 128 KB
00_sample_04.txt AC 0 ms 128 KB
test_01.txt AC 0 ms 128 KB
test_02.txt AC 0 ms 128 KB
test_03.txt AC 0 ms 128 KB
test_04.txt AC 0 ms 128 KB
test_05.txt AC 0 ms 128 KB
test_06.txt AC 0 ms 128 KB
test_07.txt AC 1 ms 128 KB
test_08.txt AC 0 ms 128 KB
test_09.txt AC 0 ms 128 KB
test_10.txt AC 0 ms 128 KB
test_11.txt AC 0 ms 128 KB
test_12.txt AC 0 ms 128 KB
test_13.txt AC 0 ms 128 KB
test_14.txt AC 0 ms 128 KB
test_15.txt AC 0 ms 128 KB
test_16.txt AC 0 ms 128 KB
test_17.txt AC 0 ms 128 KB
test_18.txt AC 0 ms 128 KB
test_19.txt AC 0 ms 128 KB
test_20.txt AC 0 ms 128 KB
test_21.txt AC 0 ms 128 KB
test_22.txt AC 0 ms 128 KB
test_23.txt AC 1 ms 128 KB
test_24.txt AC 1 ms 128 KB
test_25.txt AC 1 ms 128 KB
test_26.txt AC 1 ms 128 KB
test_27.txt AC 1 ms 128 KB
test_28.txt AC 0 ms 128 KB
test_29.txt AC 1 ms 128 KB
test_30.txt AC 1 ms 128 KB