2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)

I. Sale in GameStore（贪心）

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

A well-known Berland online games store has announced a great sale! Buy any game today, and you can download more games for free! The only constraint is that the total price of the games downloaded for free can't exceed the price of the bought game.

When Polycarp found out about the sale, he remembered that his friends promised him to cover any single purchase in GameStore. They presented their promise as a gift for Polycarp's birthday.

There are n games in GameStore, the price of the i-th game is pi. What is the maximum number of games Polycarp can get today, if his friends agree to cover the expenses for any single purchase in GameStore?

Input

The first line of the input contains a single integer number n (1 ≤ n ≤ 2000) — the number of games in GameStore. The second line contains n integer numbers p1, p2, ..., pn (1 ≤ pi ≤ 105), where pi is the price of the i-th game.

Output

Print the maximum number of games Polycarp can get today.

Sample test(s)

input

5
5 3 1 5 6

output

3

input

2
7 7

output

2

Note

In the first example Polycarp can buy any game of price 5 or 6 and download games of prices 1 and 3 for free. So he can get at most 3 games.

In the second example Polycarp can buy any game and download the other one for free.

代码能力还是太弱了（这题是贪心），排序后找

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;

 const int max_size = ;

 void quick_sort(int arry[], int l, int r)
 {
     if(l < r)
     {
         int i = l, j = r, k = arry[l];
         while(i < j)
         {
             while(i < j && arry[j] >= k)
                 j--;
             if(i < j)
                 arry[i++] = arry[j];
             while(i < j && arry[i] < k)
                 i++;
             if(i < j)
                 arry[j--] = arry[i];
         }

         arry[i] = k;
         quick_sort(arry, l, i-);
         quick_sort(arry, i+, r);
     }
 }

 int main()
 {
     int n;
     int arry[max_size];
     /// (1 ≤ n ≤ 2000)
     /// (1 ≤ pi ≤ 105)
     while(scanf("%d", &n) != EOF)
     {
         memset(arry, , sizeof(arry));
         for(int i = ; i < n; ++i)
         {
             scanf("%d", &arry[i]);
         }

         quick_sort(arry, , n-);

         int max_price = arry[n-];
         int total = ;
         int num = ;
         int j = ;
          while(j < n-)
          {
              total += arry[j++];
              if(total <= max_price)
                 num++;
          }
         printf("%d\n", num+);
     }
     return ;
 }

F题感觉学长代码写得太风骚了，看不太懂，再加油