Submission #122096


Source Code Expand

Copy
#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-9
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

int R[100];
int main() {
	int N, K;
	cin >> N >> K;
	rep(i, N) cin >> R[i];
	sort(R, R+N);
	double x = 0;
	rep(i, K) {
		if(x >= R[N-K+i]) continue;
		x = (x + R[N-K+i]) / 2;
	}
	printf("%.10f\n", x);
	return 0;
}

Submission Info

Submission Time
Task C - AtCoderプログラミング講座
User anta
Language C++ (G++ 4.6.4)
Score 100
Code Size 1465 Byte
Status AC
Exec Time 23 ms
Memory 932 KB

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 21 ms 796 KB
00_sample_02.txt AC 21 ms 800 KB
00_sample_03.txt AC 19 ms 804 KB
00_sample_04.txt AC 20 ms 676 KB
test_01.txt AC 21 ms 676 KB
test_02.txt AC 21 ms 804 KB
test_03.txt AC 22 ms 808 KB
test_04.txt AC 20 ms 804 KB
test_05.txt AC 21 ms 800 KB
test_06.txt AC 21 ms 680 KB
test_07.txt AC 21 ms 800 KB
test_08.txt AC 21 ms 808 KB
test_09.txt AC 21 ms 808 KB
test_10.txt AC 21 ms 804 KB
test_11.txt AC 21 ms 676 KB
test_12.txt AC 20 ms 800 KB
test_13.txt AC 20 ms 804 KB
test_14.txt AC 21 ms 680 KB
test_15.txt AC 21 ms 676 KB
test_16.txt AC 20 ms 804 KB
test_17.txt AC 22 ms 804 KB
test_18.txt AC 22 ms 780 KB
test_19.txt AC 22 ms 800 KB
test_20.txt AC 21 ms 800 KB
test_21.txt AC 20 ms 800 KB
test_22.txt AC 21 ms 932 KB
test_23.txt AC 21 ms 788 KB
test_24.txt AC 20 ms 800 KB
test_25.txt AC 21 ms 808 KB
test_26.txt AC 20 ms 676 KB
test_27.txt AC 20 ms 676 KB
test_28.txt AC 20 ms 792 KB
test_29.txt AC 23 ms 764 KB
test_30.txt AC 21 ms 804 KB