剑锋OI SharpSwordOI

时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as wel

Codeforces Round #241 (Div. 2) 514C Watto and Mechanism ≤,≠，≥＜＞ 时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 The Holmes children are fighting over who amongst them is the cleverest.Mycroft asked Sh

时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Moriarty has trapped n people in n distinct rooms in a hotel. Some rooms are locked, others are unlocked. But, there is a condition that the people in the ho

时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value ai.Mol

时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that

时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.He bought n pieces of jewelry. The i-th piece

时间限制：2S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions.To e

时间限制：1S / 空间限制：256MB【传送门】【问题描述】 Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism

时间限制：1S / 空间限制：256MB【问题描述】 有n个旅行团给出了n份订餐请求，每份请求包含旅行团的人数ci和消费pi，每个旅行团只能预订一个包厢。 现在共有k个包厢，第i个包厢最多接待ri个客人，每个包厢只能接待同一个旅行团的客人，如果没有一个包厢有足够的位置给某个旅行团，则这个旅行团将会离开，消费为0. 你的任务是计算最大的消费总额。【输入格式】第一行，一个整数

时间限制：1S / 空间限制：256MB【题目地址】【问题描述】【输入格式】【输出格式】【输入样例1】【输出样例1】【输入样例2】【输出样例2】【输入样例3】【输出样例3】【题目来源】【解题思路】【参考代码】“`