菜单
Implement a C++ solution for a stock trading system using Binary Search Trees (BST) to handle buy, sell, and merge operations across two accounts, supporting duplicate IDs and specific output formatting.
默认使用会先检查来源的 Prompt；你也可以切换为直接命令，或下载本地副本。
决定是否安装前，请先阅读 SKILL.md，以及 SkillsMP 当前展示的配套文件。
用 Codex 或 Claude 帮你安装 复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。
直接命令不会经过审查 Prompt；运行前请先检查来源。
npx skills add https://github.com/ECNU-ICALK/AutoSkill --skill c-bst-trading-system-with-duplicates命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地？可下载 SkillsMP 当前能够提供的文件。
Manage personal local Agent Skill files as an installable skill manager. Proactively and periodically detect reusable user-specific, team-specific, or broadly reusable skill material during or after meaningful sessions; run non-blocking extraction checks; offer candidate skill titles or accept a user-supplied topic when extraction direction is ambiguous; preserve the appropriate output language; search local and external skill ecosystems for similar skills; score candidates by evidence, recurrence, personal value, and portability; fully draft proposed skills or diffs before asking for approval; then, after explicit user approval, discard, improve, merge, or create `SKILL.md` folders.
布置结构化家庭作业，引导求助者记录现实互动事件、自动思维及情绪反应，并设计简易验证行动（如主动询问、观察反证），用于检验投射性认知偏差。适用于已识别出具体非理性信念（如‘别人肯定不喜欢我’）且情绪稳定者。
结构化8次CBT咨询流程，按评估性会谈→咨询性会谈→巩固性会谈三阶段推进，整合悬搁接地技术与认知行为策略，专用于强迫症伴轻度抑郁状态、具自省力与作业执行力的成年来访者。
基于 SOC 职业分类
正在显示 SKILL.md
| id | cf2d9df0-624d-4601-90d0-58b56b80f51c |
| name | C++ BST Trading System with Duplicates |
| description | Implement a C++ solution for a stock trading system using Binary Search Trees (BST) to handle buy, sell, and merge operations across two accounts, supporting duplicate IDs and specific output formatting. |
| version | 0.1.0 |
| tags | ["C++","BST","Data Structures","Algorithm","Competitive Programming"] |
| triggers | ["implement bst trading system","bst buy sell merge","binary search tree with duplicates","c++ stock account management"] |
Implement a C++ solution for a stock trading system using Binary Search Trees (BST) to handle buy, sell, and merge operations across two accounts, supporting duplicate IDs and specific output formatting.
You are a C++ competitive programmer. Your task is to implement a stock trading system using Binary Search Trees (BSTs) to manage two accounts (0 and 1).
id, left, right, parent).buy account id: Insert id into the BST for the specified account (0 or 1).sell account id: Delete id from the BST for the specified account.merge: Merge all elements from account 1 into account 0. Clear account 1 after merging.x >= temp->id goes right).merge operation, print the IDs in account 0 in sorted order (in-order traversal).
n (number of operations). Subsequent lines are commands.