{
"title": "Herb Collection",
"description": "Chenchen is a gifted child with a dream of becoming the greatest physician. To test his potential, a renowned physician takes him to a cave filled with various herbs. Each herb requires a certain amount of time to harvest and has its own value. Given a limited time, Chenchen needs to maximize the total value of the herbs he collects. Can you help Chenchen achieve this task?",
"input": "The first line contains two integers $T$ (1 ≤ $T$ ≤ 1000) and $M$ (1 ≤ $M$ ≤ 100), where $T$ represents the total time available for collecting herbs, and $M$ represents the number of herbs in the cave. The next $M$ lines each contain two integers, representing the time required to harvest a particular herb and its value, both ranging from 1 to 100.",
"output": "Output the maximum total value of herbs that can be collected within the given time.",
"hint": "- For 30% of the data, $M$ ≤ 10;\n- For all data, $M$ ≤ 100.",
"tags": [
"Dynamic Programming",
"Knapsack"
],
"target_lang": "中文"
}
curl --location --request POST '/problem/translate' \
--header 'Authorization: Bearer 131Fa67D3C52f8d27BbDb777eC23dE3Bb68A24109Fb4c46Cd78471fAa3f9d529' \
--header 'Content-Type: application/json' \
--data-raw '{
"title": "Herb Collection",
"description": "Chenchen is a gifted child with a dream of becoming the greatest physician. To test his potential, a renowned physician takes him to a cave filled with various herbs. Each herb requires a certain amount of time to harvest and has its own value. Given a limited time, Chenchen needs to maximize the total value of the herbs he collects. Can you help Chenchen achieve this task?",
"input": "The first line contains two integers $T$ (1 ≤ $T$ ≤ 1000) and $M$ (1 ≤ $M$ ≤ 100), where $T$ represents the total time available for collecting herbs, and $M$ represents the number of herbs in the cave. The next $M$ lines each contain two integers, representing the time required to harvest a particular herb and its value, both ranging from 1 to 100.",
"output": "Output the maximum total value of herbs that can be collected within the given time.",
"hint": "- For 30% of the data, $M$ ≤ 10;\n- For all data, $M$ ≤ 100.",
"tags": [
"Dynamic Programming",
"Knapsack"
],
"target_lang": "中文"
}'
{
"code": 0,
"msg": "string",
"data": {
"title": "string",
"description": "string",
"input": "string",
"output": "string",
"hint": "string",
"tags": [
"string"
]
}
}