Submission #122491


Source Code Expand

Copy
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
//-------------------------------------------
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
//-------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main(int argc, const char * argv[])
{
  int n,k;
  VI r;
  int temp;
  double result=0;
  cin >> n >> k;
  FOR(i,0,n){
    cin >> temp;
    r.push_back(temp);
  }
  sort(r.begin(),r.end());
  FOR(i,n-k,n){
    result += (double)r[i];
    result /= (double)2;
  }
  printf("%.9lf\n",result);
  
  return 0;
}

Submission Info

Submission Time
Task C - AtCoderプログラミング講座
User kikunantoka
Language C++ (G++ 4.6.4)
Score 100
Code Size 2311 Byte
Status AC
Exec Time 25 ms
Memory 924 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 24 ms 920 KB
00_sample_02.txt AC 24 ms 916 KB
00_sample_03.txt AC 22 ms 808 KB
00_sample_04.txt AC 19 ms 796 KB
test_01.txt AC 19 ms 920 KB
test_02.txt AC 22 ms 800 KB
test_03.txt AC 22 ms 800 KB
test_04.txt AC 20 ms 916 KB
test_05.txt AC 22 ms 808 KB
test_06.txt AC 22 ms 920 KB
test_07.txt AC 22 ms 796 KB
test_08.txt AC 22 ms 800 KB
test_09.txt AC 21 ms 796 KB
test_10.txt AC 23 ms 812 KB
test_11.txt AC 20 ms 796 KB
test_12.txt AC 22 ms 716 KB
test_13.txt AC 21 ms 796 KB
test_14.txt AC 22 ms 780 KB
test_15.txt AC 23 ms 800 KB
test_16.txt AC 25 ms 852 KB
test_17.txt AC 22 ms 924 KB
test_18.txt AC 24 ms 912 KB
test_19.txt AC 25 ms 924 KB
test_20.txt AC 23 ms 796 KB
test_21.txt AC 22 ms 924 KB
test_22.txt AC 22 ms 720 KB
test_23.txt AC 23 ms 920 KB
test_24.txt AC 23 ms 896 KB
test_25.txt AC 22 ms 800 KB
test_26.txt AC 24 ms 920 KB
test_27.txt AC 22 ms 800 KB
test_28.txt AC 24 ms 796 KB
test_29.txt AC 22 ms 924 KB
test_30.txt AC 22 ms 796 KB