313C - Ilya and Matrix - CodeForces Solution


constructive algorithms greedy implementation sortings *1400

Please click on ads to support us..

Python Code:

def beauty(a, size):
    if size == 0:
        return max(a)
    else:
        total = max(a) + sum(a)
        b = sorted(a, reverse=True)
        
        power = 1
        while (size-1) > 0:
            total += sum(b[:4 ** power])
            power += 1
            size -= 1
        return total

import math

n = int(input())
a = [int(i) for i in input().split()]
size = int(math.log(n, 4))

print(beauty(a, size))

      		 		 				 		 	  	 	 				


Comments

Submit
0 Comments
More Questions

1144A - Diverse Strings
1553B - Reverse String
1073A - Diverse Substring
630N - Forecast
312B - Archer
34D - Road Map
630I - Parking Lot
160B - Unlucky Ticket
371B - Fox Dividing Cheese
584B - Kolya and Tanya
137B - Permutation
550C - Divisibility by Eight
5A - Chat Servers Outgoing Traffic
615A - Bulbs
5B - Center Alignment
549A - Face Detection
535B - Tavas and SaDDas
722C - Destroying Array
366A - Dima and Guards
716B - Complete the Word
1461C - Random Events
1627A - Not Shading
141B - Hopscotch
47B - Coins
1466C - Canine poetry
74A - Room Leader
1333D - Challenges in school №41
1475B - New Year's Number
461A - Appleman and Toastman
320B - Ping-Pong (Easy Version)