Problem:
Score : 700 points

Problem Statement

We have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.
Vertex 1 is the root, and the parent of Vertex i (i \geq 2) is Vertex \left[ \frac{i}{2} \right].

Each vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.
Now, process the following query Q times:

Given are a vertex v of the tree and a positive integer L.
Let us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.
Find the maximum possible total value of the chosen items.

Here, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\ldots,w_k (k\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.

Constraints

All values in input are integers.

1 \leq N < 2^{18}

1 \leq Q \leq 10^5

1 \leq V_i \leq 10^5

1 \leq W_i \leq 10^5

For the values v and L given in each query, 1 \leq v \leq N and 1 \leq L \leq 10^5.

Input

Let v_i and L_i be the values v and L given in the i-th query.
Then, Input is given from Standard Input in the following format:

N
V_1 W_1
:
V_N W_N
Q
v_1 L_1
:
v_Q L_Q

Output

For each integer i from 1 through Q,
the i-th line should contain the response to the i-th query.

Sample Input 1

3
1 2
2 3
3 4
3
1 1
2 5
3 5

Sample Output 1

0
3
3

In the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.

In the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.

Sample Input 2

15
123 119
129 120
132 112
126 109
118 103
115 109
102 100
130 120
105 105
132 115
104 102
107 107
127 116
121 104
121 115
8
8 234
9 244
10 226
11 227
12 240
13 237
14 206
15 227

Sample Output 2

256
255
250
247
255
259
223
253

Solution in C++ (Clang 10.0.0) (judge verdict: Time Limit Exceeded)

#include <iostream>
#include <tuple>
#include <vector>
#include <algorithm>
using namespace std;
const int maxSize=400;
int amount;
vector<vector<int>> tree(maxSize, vector<int>(1));
vector<tuple<int, int, int>> values(maxSize);
vector<tuple<int, int>> weights(maxSize);
vector<tuple<int, int, int>> selectedValues(maxSize);
vector<int> sumValues(maxSize);
void fillingValues()
{
	int pointValue, pointWeight;
	cin>>amount;
	//Changing all parameters-vector's sizes to 0.
	/*
  	values.resize(0);
	weights.resize(0);
	selectedValues.resize(0);
	sumValues.resize(0);
    */
	for(int point=1; point<=amount; ++point)
	{
		cin>>pointValue>>pointWeight;
		values.push_back(make_tuple(point, pointValue, pointWeight));
	}
	return;
}
void fillingWeights()
{
	int borderPoint, borderWeight, queryNumbers;
	cin>>queryNumbers;
	for(int i=1; i<=queryNumbers; ++i)
	{
		cin>>borderPoint>>borderWeight;
		weights.push_back(make_tuple(borderPoint, borderWeight));
	}
	return;
}
/*
void creatingTree(int root)
{
	if(root>amount)
	{
		return;
	}
	tree[root].push_back(2*root);
	tree[root].push_back(2*root+1);
	tree[2*root].push_back(root);
	tree[2*root+1].push_back(root);
	creatingTree(2*root);
	creatingTree(2*root+1);
	return;
}
*/
void dfs(int root, int borderWeight)
{
	if(root==0)
	{
		for(int i=0; i<selectedValues.size()-1; ++i)
		{
			for(int j=(i+1); j<selectedValues.size(); ++j)
			{
				if((get<2>(selectedValues[i])+get<2>(selectedValues[j]))<=borderWeight)
				{
					sumValues.push_back((get<1>(selectedValues[i])+get<1>(selectedValues[j])));
				}
			}
		}
		cout<<*max_element(sumValues.begin(), sumValues.end())<<endl;
		return;
	}
	for(int i=0; i<values.size(); ++i)
	{
		if(get<0>(values[i])==root)
		{
			selectedValues.push_back(values[i]);
		}
	}
	dfs(root/2, borderWeight);
	return;
}
void usingDfs()
{
	for(int i=0; i<weights.size(); ++i)
	{
		dfs(get<0>(weights[i]), get<1>(weights[i]));
		sumValues.clear();
		selectedValues.clear();
	}
	return;
}
int main()
{
	fillingValues();
	fillingWeights();
	//creatingTree(1);
	usingDfs();
	return 0;
}