Skip to content

3457. Eat Pizzas! 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
 public:
  long long maxWeight(vector<int>& pizzas) {
    const int eat = pizzas.size() / 4;
    const int odd = (eat - 1) / 2 + 1;  // ceil(eat / 2)
    const int even = eat - odd;
    long ans = 0;
    int i = 0;  // pizzas' index

    ranges::sort(pizzas, std::greater<>());

    for (int j = 0; j < odd; ++j, i += 1)
      ans += pizzas[i];

    for (int j = 0; j < even; ++j, i += 2)
      ans += pizzas[i + 1];

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
class Solution {
  public long maxWeight(int[] pizzas) {
    final int eat = pizzas.length / 4;
    final int odd = (eat - 1) / 2 + 1; // ceil(eat / 2)
    final int even = eat - odd;
    long ans = 0;
    int i = pizzas.length - 1; // pizzas' index

    Arrays.sort(pizzas);

    for (int j = 0; j < odd; ++j, i -= 1)
      ans += pizzas[i];

    for (int j = 0; j < even; ++j, i -= 2)
      ans += pizzas[i - 1];

    return ans;
  }
}

1
2
3
4
5
6
7
8
class Solution:
  def maxWeight(self, pizzas: list[int]) -> int:
    eat = len(pizzas) // 4
    odd = math.ceil(eat / 2)
    even = eat - odd
    pizzas.sort(reverse=True)
    return (sum(pizzas[:odd]) +
            sum(pizzas[odd + 1:odd + 1 + even * 2:2]))