codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

659C.md (2328B)


      1 Source: https://codeforces.com/problemset/problem/659/C
      2 
      3 C. Tanya and Toys
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 Tania has managed to collect *n* different types of toys *a*1, *a*2, ..., *a**n* 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.
     24 
     25 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.
     26 
     27 Input
     28 
     29 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.
     30 
     31 The next line contains *n* distinct integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 109) — the types of toys that Tanya already has.
     32 
     33 Output
     34 
     35 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*.
     36 
     37 In the second line print *k* distinct space-separated integers *t*1, *t*2, ..., *t**k* (1 ≤ *t**i* ≤ 109) — the types of toys that Tanya should choose.
     38 
     39 If there are multiple answers, you may print any of them. Values of *t**i* can be printed in any order.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3 7  
     47 1 3 4
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 2  
     54 2 5
     55 ```
     56 
     57 Input
     58 
     59 ```
     60 4 14  
     61 4 6 12 8
     62 ```
     63 
     64 Output
     65 
     66 ```
     67 4  
     68 7 2 3 1
     69 ```
     70 
     71 Note
     72 
     73 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.