2016NEFU集训第n+3场 G - Tanya and Toys
Description
In Berland recently a new collection of toys went on sale. This collection consists of 109 types of toys, numbered with integers from 1to 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
2
2 5
4 14
4 6 12 8
4
7 2 3 1 //有一点没有注意导致错了很多次,q==0时我又把a[q-1]给输出了。。。
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std; int data[],a[]; int main()
{
int n,k;
while(cin>>n>>k)
{
int m=,sum=,q=;
memset(data,,sizeof(data));
for(int i=;i<n;i++)
cin>>data[i];
sort(data,data+n);
memset(a,,sizeof(a));
for(int i=;i<=k;i++)
{
if(data[m]==i&&m<n)
{
m++;continue;
}
else
{
if(sum+i<=k)
{
sum+=i;
a[q]=i;
q++;
}
else
break;
}
}
cout<<q<<endl;
if(q==)
continue;
for(int i=;i<q-;i++)
cout<<a[i]<<" ";
cout<<a[q-]<<endl;
}
return ;
}
最新文章
- Spring基础学习笔记-Bean的基础知识
- Linux下lampp详解 (转)
- javascript创建对象的方法总结
- WebBrowser的各种使用方法(未完待续)(XE8+WIN7)
- 怎么都没人提 google 加密搜索呢? google如何稳定打开
- Servlet Examples
- 在 window7 window8下公布webService注意问题
- JS预览图像将本地图片显示到浏览器上
- Java中的回调
- Linux DHCP原理
- 【Android】带进度条的WebView
- MongoDB之整库备份还原单表collection备份还原
- 《Java从入门到精通》学习总结1
- (1)ESP8266微信门铃
- first*php*self*
- java.lang.IllegalStateException: Failed to load property source from location &#39;classpath:/application-dev.yml&#39;
- day5 模拟购物车程序
- Flask web开发之路十一
- Bootstrap 导航元素(标签页)
- 库函数方式文件编程----fopen