贪心 Codeforces Round #287 (Div. 2) A. Amr and Music

题目传送门

 /*
     贪心水题
 */
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <cmath>
 #include <cstring>
 #include <vector>
 #include <set>
 #include <map>
 #include <string>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 struct NODE
 {
     int num, id;
 }node[MAXN];

 bool cmp(NODE a, NODE b)
 {
     return a.num < b.num;
 }

 void work(int n, int k)
 {
     int x = ;    int sum = ;
     for (int i=; i<=n; ++i)
     {
         sum += node[i].num;        x = i;
         if (sum > k)
         {
             x -= ;        break;
         }
     }

     printf ("%d\n", x);
     for (int i=; i<=x; ++i)
     {
         printf ("%d%c", node[i].id, (i==x) ? '\n' : ' ');
     }

 }

 int main(void)
 {
     #ifndef ONLINE_JUDGE
     freopen ("A.in", "r", stdin);
     #endif

     int n, k;
     while (~scanf ("%d%d", &n, &k))
     {
         for (int i=; i<=n; ++i)
         {
             scanf ("%d", &node[i].num);
             node[i].id = i;
         }

         sort (node+, node++n, cmp);

         work (n, k);
     }

     return ;
 }