Submission #7527176


Source Code Expand

Copy
#include <iostream>
#include <queue>
#include <math.h>
using namespace std;

main(){
	int n,k,tmp;
	int a[100010];
	long long ans;
	ans = 0;
	priority_queue<int> pq;
	
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		pq.push(a[i]);
	}
	
	while(k--){
		tmp = pq.top();
		tmp -= round(double(tmp)/2);
		pq.pop();
		pq.push(tmp);
	}
	for(int i=1;i<=n;i++){
		ans += pq.top();
		pq.pop();
	}
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task D - Powerful Discount Tickets
User Ccucumber12
Language C++14 (GCC 5.4.1)
Score 400
Code Size 438 Byte
Status AC
Exec Time 62 ms
Memory 1148 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 23
AC × 4
Set Name Test Cases
All sample_01, sample_02, sample_03, sample_04, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19
Sample sample_01, sample_02, sample_03, sample_04
Case Name Status Exec Time Memory
sample_01 AC 2 ms 384 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 2 ms 256 KB
sample_04 AC 1 ms 256 KB
testcase_01 AC 33 ms 892 KB
testcase_02 AC 14 ms 384 KB
testcase_03 AC 51 ms 1148 KB
testcase_04 AC 62 ms 1148 KB
testcase_05 AC 23 ms 768 KB
testcase_06 AC 50 ms 1148 KB
testcase_07 AC 11 ms 512 KB
testcase_08 AC 52 ms 1148 KB
testcase_09 AC 34 ms 892 KB
testcase_10 AC 14 ms 512 KB
testcase_11 AC 33 ms 1148 KB
testcase_12 AC 50 ms 1148 KB
testcase_13 AC 10 ms 256 KB
testcase_14 AC 53 ms 1148 KB
testcase_15 AC 62 ms 1148 KB
testcase_16 AC 17 ms 384 KB
testcase_17 AC 1 ms 256 KB
testcase_18 AC 1 ms 256 KB
testcase_19 AC 47 ms 1148 KB