zoukankan      html  css  js  c++  java
  • codeforces 659C C. Tanya and Toys(水题+map)

    题目链接:

    C. Tanya and Toys

    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    In Berland recently a new collection of toys went on sale. This collection consists of 109 types of toys, numbered with integers from 1 to109. 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.

    Examples
    input
    3 7
    1 3 4
    output
    2
    2 5
    input
    4 14
    4 6 12 8
    output
    4
    7 2 3 1
    Note

    In the first sample mom should buy two toys: one toy of the 2-nd type and one toy of the 5-th type. At any other purchase for 7 bourles (assuming that the toys of types 1, 3 and 4 have already been bought), it is impossible to buy two and more toys.

    题意:

    问选没有过的toy能最多选多少个;

    思路:

    从小到大贪心,用map记录是否已经有过;

    AC代码:

    /*
    2014300227    659C - 50    GNU C++11    Accepted    93 ms    7380 KB
    */
    #include <bits/stdc++.h>
    using namespace std;
    const int N=1e5+4;
    int n,m,x;
    int a[N],ans[N];
    map<int,int>mp;
    int main()
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x);
            mp[x]=1;
        }
        long long sum=0;
        int cnt=0;
        for(int i=1;i<=1e9;i++)
        {
            if(!mp[i])
            {
                if(sum+(long long)i<=m)
                ans[cnt++]=i,sum+=(long long)i;
                else
                {
                    break;
                }
            }
        }
        printf("%d
    ",cnt);
        for(int i=0;i<cnt;i++)
        {
            printf("%d ",ans[i]);
        }
    
        return 0;
    }
  • 相关阅读:
    Netty ByteBuf(图解之 2)| 秒懂
    【转】 RGB各种格式
    缺少动态库报错
    bug:进程可调用函数而子线程调用报错
    【转】 pthread设置线程的调度策略和优先级
    【转】 C++析构函数的作用和用法
    【转】 g++编译时对'xxxx'未定义的引用问题(undefined reference to)
    【转】 C语言文件操作详解
    【转】 H.264编码原理以及I帧B帧P帧
    【转】 strrchr()函数---C语言
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5340687.html
Copyright © 2011-2022 走看看