Submission #6990475


Source Code Expand

Copy
<?php
fscanf(STDIN, '%d', $n);
$v = array_map('intval', explode(' ', trim(fgets(STDIN))));
$q = new SplPriorityQueue();
for($i = 0; $i < $n; $i++) {
    $q->insert($v[$i], -$v[$i]);
}
while ($q->count() > 1) {
    $x = $q->extract();
    $y = $q->extract();
    $z = ($x + $y) / 2;
    $q->insert($z, -$z);
}
$ans = $q->extract();
echo $ans . PHP_EOL;

Submission Info

Submission Time
Task C - Alchemist
User hideyuk1
Language PHP7 (7.0.15)
Score 300
Code Size 365 Byte
Status AC
Exec Time 12 ms
Memory 4728 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 12 ms 4728 KB
a02 AC 9 ms 4604 KB
a03 AC 9 ms 4604 KB
b04 AC 9 ms 4604 KB
b05 AC 9 ms 4604 KB
b06 AC 9 ms 4604 KB
b07 AC 9 ms 4604 KB
b08 AC 9 ms 4604 KB
b09 AC 9 ms 4604 KB
b10 AC 10 ms 4604 KB
b11 AC 10 ms 4604 KB
b12 AC 9 ms 4604 KB
b13 AC 10 ms 4604 KB