上原题:
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 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.
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.
上代码:
#include"iostream"
#include"string.h"
#include"algorithm"
using namespace std;
bool gifted[99999999];
int last[200000];
int main()
{
std::ios::sync_with_stdio(false);
int n, m;
while (cin >> n >> m)
{
for (int i = 1; i <= n; i++)
{
int a;
cin >> a;
if(a<200000)
gifted[a] = 1;
}
int sum = 0;
int num = 0;
int pos = 0;
for ( int i = 1;; i++)
{
if (!gifted[i])
{
if (sum + i <= m)
{
sum = sum + i;
num++;
last[pos] = i;
pos++;
}
else
break;
}
}
if (num == 0)
cout << "0" << endl;
else
{
cout << num << endl;
for (int i = 0; i < pos - 1; i++)
cout << last[i] << " ";
cout << last[pos - 1] << endl;
}
}
return 0;
}
这个题的意思是我有n个糖,有m元钱。
第几个序号的糖就是几元钱,然后看看除了我有的糖以外自己最多可以买多少糖糖。
然后输入自己有的糖。。
代码很好理解。。可以不用理解,,,
大概就是把自己有的糖存为1,没有的存0,跑循环加加加。
看到大家都是用vector写的。但是这个用的不熟练,就没有用这个。。。。嗯尽快补上这一块的知识。
然后得到两个教育orz。
第一个是bool类型可以比数组多存好多好多数,以后判断就用bool类型不要用数组了。
第二个并没搞懂,为什么编译器跑不出对的程序,很惶恐。
嘛生气的原因是这道题明明很简单嘛什么高档的东西都没有,但是一直过不了。就很气。
2333怎么这么像一个牢骚贴233333
以上。