zoukankan      html  css  js  c++  java
  • Codeforces Round #346 (Div. 2) C题

    C. Tanya and Toys

    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.

    Input

    3 7
    1 3 4

    Output

    2
    2 5 

    思路:暴力出奇迹.

    AC代码:

     1 #include<bits/stdc++.h>
     2 
     3 using namespace std;
     4 #define N 1000009
     5 int arr[N];
     6 map<int,int> mp;
     7 int main(){
     8     int n,m;
     9     cin>>n>>m;
    10     for(int i=0;i<n;i++){
    11         int t;
    12         scanf("%d",&t);
    13         mp[t]=1; 
    14     }
    15     int cnt=0;
    16     for(int i=1;;i++){
    17         if(!mp[i]){
    18             if(m-i>=0){
    19                 arr[cnt++]=i;
    20                 m-=i;
    21             }else{
    22                 break;
    23             }
    24         }
    25     }
    26     printf("%d
    ",cnt);
    27     for(int i=0;i<cnt;i++){
    28         printf("%d ",arr[i]);
    29     } 
    30     return 0;
    31 } 
  • 相关阅读:
    20.12.2 leetcode7
    20.12.1 leetcode34
    20.11.30 leetcode767
    20.11.29 leetcode976
    Codeforces632E 选择/小偷与商店 背包DP
    魔法少女 DP NG放的水
    逆反的01串 模拟 NG放的水
    最大数maxnumber bzoj1012 JSOI2008 单调队列
    组合数问题 vijos2006 NOIP2016 D2T1 杨辉三角 排列组合 前缀和
    信息传递 vijos1979 NOIP2015D1T2 强连通分量 tarjan模版题
  • 原文地址:https://www.cnblogs.com/pengge666/p/11514512.html
Copyright © 2011-2022 走看看