Submission #1867114
Source Code Expand
//高いのn個選んで、低い順に見る。 #include<cstdio> #include<algorithm> #include<functional> using namespace std; int main(){ int n,k; scanf("%d %d", &n, &k); double a[100]={}; for (int i=0;i<n;i++) scanf("%lf", &a[i]); sort(a,a+n,greater<float>()); //配列のsort 降順 double sum=0.0; for (int i=k-1;i>=0;i--) { sum = (sum + a[i])/2.0; } printf("%lf\n", sum); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoderプログラミング講座 |
User | Rika |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 433 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &k); ^ ./Main.cpp:13:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &a[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 |