API Response (JSON)
{
"problem": {
"name": "[USACO22DEC] Cow College B",
"description": {
"content": "Farmer John 计划为奶牛们新开办一所大学!  有 $N(1 \\le N \\le 10^5)$ 头奶牛可能会入学。每头奶牛最多愿意支付 $c_i$ 的学费 $(1 \\le c_i \\le 10^6)$。 Farmer John 可以设定所有奶牛入学需要支付的学",
"description_type": "Markdown"
},
"platform": "Luogu",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": {
"LuoguStyle": "P2"
},
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "LGP8897"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Farmer John 计划为奶牛们新开办一所大学! \n\n\n\n有 $N(1 \\le N \\le 10^5)$ 头奶牛可能会入学。每头奶牛最多愿意支付 $c_i$ 的学费 $(1 \\le c_i \\le 10^6)$。 Farmer John 可以设定所有奶牛入学需要支付的学...",
"is_translate": false,
"language": "English"
}
]
}