Posted on 2009-08-05 15:41
Hero 阅读(275)
评论(0) 编辑 收藏 引用 所属分类:
代码如诗－－ACM
1 // HLOJ 1030 Accepted 0 140 558 C++
2
3 #include <iostream>
4
5 using namespace std ;
6
7 const int size = 1200 ;
8 int inn, len ;
9
10 int data[size] ;
11
12 int cmp( const void * a, const void *b )
13 {
14 return *(int *)a - *(int *)b ;
15 }
16
17 int main()
18 {
19 while( cin >> inn >> len )
20 {
21 for( int i=1; i<=inn; i++ ) cin >> data[i] ;
22
23 qsort( data+1, inn, sizeof(data[0]), cmp ) ;
24
25 int out = 0 ; int curlen = 0 ;
26 for( int i=1; i<=inn; i++ )
27 {
28 curlen += data[i] ;
29
30 if( curlen > len ) break ;
31
32 out = out + 1 ;
33 }
34
35 cout << out << endl ;
36 }
37
38 return 0 ;
39 }
40