Codeforces Round #346 (Div. 2) C. Tanya and Toys
2016-04-08 14:12
381 查看
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
output
input
output
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.
本题的题意是一开始就拥有一些东西,给一定的金额,让你挑选尽可能多的不重复的东西。
贪心,从小到大依次实验,用set保存一开始就有的,防止重复;
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.
本题的题意是一开始就拥有一些东西,给一定的金额,让你挑选尽可能多的不重复的东西。
贪心,从小到大依次实验,用set保存一开始就有的,防止重复;
#include<bits/stdc++.h> using namespace std; set<int> s; vector<int> ans; int main() { int n,m; scanf("%d %d",&n,&m); int temp; for(int i=0;i<n;++i) { scanf("%d",&temp); s.insert(temp); } int sum=0; for(int i=1;i<=1000000000;++i) { if(s.count(i)) continue; else { if(sum+i>m) break; else {ans.push_back(i);sum+=i;} } } printf("%d\n",ans.size()); for(int i=0;i<ans.size();++i) printf("%d ",ans[i]); printf("\n"); return 0; }
相关文章推荐
- Sublime Text Snippets(代码片段)功能
- 构造型模式之(Factory Method)工厂方法模式
- repo 建立
- #define f(a, b) a##b
- android快速实现毛玻璃效果
- Android 打开本地的手机软件市场评分
- apache 提示You don't have permission to access /test.php on this server.怎样解决
- 数据仓库中的慢变化维度和快变化维度
- 理论 E-learning课件AICC标准和SCORM标准
- 剑指Offer——不能被继承的类
- 【LeetCode】84. Largest Rectangle in Histogram
- select function in ruby
- CSS垂直三列居中,中间自适应
- 排序--插入
- 容器模式
- java操作oracle的blob,clob数据
- multi_array.php
- Mybatis传多个参数
- struts2修改文件上传的大小
- 池技术----线程池