domek z kart na 40 pkt zachłannie

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n, k, s = 0, curr = 0;
  cin >> n >> k;
  k /= 2;
  vector<int> G;
  G.push_back(0);
  for(int i = 0;i < n;i++)
    for(int j = 0, a, b;j < 1 << i;j++){
      cin >> a >> b;
      G.push_back(a + b);
    }
  priority_queue<pair<int, int> > opcje;
  opcje.push(make_pair(G[1], 1));
  while(k--){
    pair<int, int> v = opcje.top();
    curr += v.first;
    opcje.pop();
    if(v.second < 1 << (n-1)){
      opcje.push(make_pair(G[v.second * 2], v.second * 2));
      opcje.push(make_pair(G[v.second * 2 + 1], v.second * 2 + 1));
    }
    s = max(s, curr);
  }
  cout << s;
}