#include <iostream>
#include <vector>
 
using namespace std;
 
// A node in an n-ary tree
struct Node
{
    int value;
    vector<Node*> children;
};
 
// Find the sum of the largest increasing branch in an n-ary tree
int largestIncreasingBranchSum(Node* node)
{
    // Base case: If the node has no children, it is the leaf node
    // and the sum of the branch is the value of the node
    if (node->children.empty())
    {
        return node->value;
    }
 
    // Initialize the sum of the branch to the value of the node
    int sum = node->value;
 
    // Iterate through the children of the node
    for (Node* child : node->children)
    {
        // If the value of the node is less than the value of the child,
        // add the sum of the largest increasing branch starting from the child
        if (node->value < child->value)
        {
            sum += largestIncreasingBranchSum(child);
        }
    }
 
    // Return the sum of the branch
    return sum;
}
 
int main()
{
    // Create the example n-ary tree
    Node* root = new Node{10};
    root->children.push_back(new Node{6});
    root->children.push_back(new Node{12});
    root->children[0]->children.push_back(new Node{4});
    root->children[0]->children.push_back(new Node{8});
    root->children[1]->children.push_back(new Node{11});
    root->children[1]->children.push_back(new Node{13});
 
    // Find the sum of the largest increasing branch
    int sum = largestIncreasingBranchSum(root);
 
    // Print the sum
    std::cout << "Sum of the largest increasing branch: " << sum << std::endl;
 
    return 0;
}