Submission #1911008
Source Code Expand
#include <stdio.h> int compare_int(const void *a, const void *b){ return *(int*)a - *(int*)b; } int main(void){ double rate = 0; int n, k; scanf("%d",&n); scanf("%d",&k); int r[n]; int i; for(i = 0; i < n; i++){ scanf("%d",&r[i]); } qsort(r, n, sizeof(int), compare_int); int j; for(j = 0; j < k; j++){ rate = (rate + r[n-k+j])/2;//小さいものから順に最大値まで見る } printf("%f\n",rate); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoderプログラミング講座 |
User | ReiAkiduki |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 471 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:19:2: warning: implicit declaration of function ‘qsort’ [-Wimplicit-function-declaration] qsort(r, n, sizeof(int), compare_int); ^ ./Main.c:10:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.c:11:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&k); ^ ./Main.c:16:3: 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 |
|
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 | 1 ms | 128 KB |
00_sample_02.txt | AC | 1 ms | 128 KB |
00_sample_03.txt | AC | 1 ms | 128 KB |
00_sample_04.txt | AC | 1 ms | 128 KB |
test_01.txt | AC | 1 ms | 128 KB |
test_02.txt | AC | 1 ms | 128 KB |
test_03.txt | AC | 1 ms | 128 KB |
test_04.txt | AC | 1 ms | 128 KB |
test_05.txt | AC | 1 ms | 128 KB |
test_06.txt | AC | 1 ms | 128 KB |
test_07.txt | AC | 1 ms | 128 KB |
test_08.txt | AC | 1 ms | 128 KB |
test_09.txt | AC | 1 ms | 128 KB |
test_10.txt | AC | 1 ms | 128 KB |
test_11.txt | AC | 1 ms | 128 KB |
test_12.txt | AC | 1 ms | 128 KB |
test_13.txt | AC | 1 ms | 128 KB |
test_14.txt | AC | 1 ms | 128 KB |
test_15.txt | AC | 1 ms | 128 KB |
test_16.txt | AC | 1 ms | 128 KB |
test_17.txt | AC | 1 ms | 128 KB |
test_18.txt | AC | 1 ms | 128 KB |
test_19.txt | AC | 1 ms | 128 KB |
test_20.txt | AC | 1 ms | 128 KB |
test_21.txt | AC | 1 ms | 128 KB |
test_22.txt | AC | 1 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 | 1 ms | 128 KB |
test_29.txt | AC | 1 ms | 128 KB |
test_30.txt | AC | 1 ms | 128 KB |