摘要:
Codeforces Round #610 (Div. 2) https://codeforces.com/problemset/problem/1282/B1 题意:购买商品简单版:Vasya想用钱买尽可能多的商品数,这里k为2,即允许任意买的两件商品中只为其中较贵的商品付款,而且这种机会在每种情 阅读全文
摘要:
Codeforces Round #607 (Div. 2) https://codeforces.com/problemset/problem/1281/B 题意:每个测试用例给定两个字符串chr1,chr2,若按字典序排序前者小于后者则直接输出chr1,否则对chr1字符数组最多交换一对字符,若 阅读全文