Submission #1768387
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define ull long long unsigned using namespace std; #define foru(i,a,n) for (int i=(a); i<=(n); i++) #define ford(i,n,a) for (int i=(n); i>=(a); i--) #define rep(i,n) for(int i=0; i<n; i++) #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second #define bit1cnt(x) (__builtin_popcountll(x)) #define sqr(x) ((x) * (x)) #define sz(x) ((int)(x.size())) #define Pi 3.14159265358979 #define ii pair<int,int> #define cap pair<double,ll> const int N = 222; int n, k; double a[N], fr[N], ans = 0; int main(){ ///freopen("C.inp","r",stdin); ios::sync_with_stdio(0); cin.tie(0); cin >>n >>k; foru(i,1,n) cin >>a[i]; while(k>0){ foru(i, 1, n) a[i]/=2; int t = 0; foru(i, 1, n) if(fr[i]==0 && a[i]>a[t]) t = i; fr[t] = 1; ans += a[t]; k--; } cout <<fixed <<setprecision(8) <<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoderプログラミング講座 |
User | phuleethanh |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1001 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 384 KB |
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 | 4 ms | 384 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |