Codeforces Round #346 (Div. 2) C. Tanya and Toys 贪心-优快云博客

本文介绍了一道名为“Tanya and Toys”的编程题的解题思路及实现代码。题目要求在已有的玩具基础上，利用限定金额购买尽可能多的不同种类的新玩具。文章提供了贪心算法解决方案，并附上了完整的C++代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

C. Tanya and Toys

题目连接：

http://www.codeforces.com/contest/659/problem/C

Description

In Berland recently a new collection of toys went on sale. This collection consists of 109 types of toys, numbered with integers from 1 to 109. A toy from the new collection of the i-th type costs i bourles.

Tania has managed to collect n different types of toys a1, a2, ..., an from the new collection. Today is Tanya's birthday, and her mother decided to spend no more than m bourles on the gift to the daughter. Tanya will choose several different types of toys from the new collection as a gift. Of course, she does not want to get a type of toy which she already has.

Tanya wants to have as many distinct types of toys in her collection as possible as the result. The new collection is too diverse, and Tanya is too little, so she asks you to help her in this.

Input

The first line contains two integers n (1 ≤ n ≤ 100 000) and m (1 ≤ m ≤ 109) — the number of types of toys that Tanya already has and the number of bourles that her mom is willing to spend on buying new toys.

The next line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the types of toys that Tanya already has.

Output

In the first line print a single integer k — the number of different types of toys that Tanya should choose so that the number of different types of toys in her collection is maximum possible. Of course, the total cost of the selected toys should not exceed m.

In the second line print k distinct space-separated integers t1, t2, ..., tk (1 ≤ ti ≤ 109) — the types of toys that Tanya should choose.

If there are multiple answers, you may print any of them. Values of ti can be printed in any order.

Sample Input

3 7
1 3 4

Sample Output

2
2 5

Hint

题意

有无限多种商品，第i个商品值i元，现在你已经有了n个商品，你想花m元去买尽量多的不同的商品

问你应该买哪些物品。

题解：

贪心就好了，肯定拿的是最便宜的那些物品，然后扫一遍就好了。

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+7;
long long a[maxn];
vector<int> ans;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+1+n);
    for(int i=1,j=1;;i++)
    {
        if(j<=n&&i==a[j])j++;
        else if(m<i)break;
        else m-=i,ans.push_back(i);
    }
    cout<<ans.size()<<endl;
    for(int i=0;i<ans.size();i++)
        cout<<ans[i]<<" ";
    cout<<endl;
}

转载于:https://www.cnblogs.com/qscqesze/p/5341957.html