Nyoj 71 Canoe Trip (greedy)

Travel time limits on canoes: MS | Memory limit: 65535 KB Difficulty: 2

Describe

For a canoe trip, canoes can be rented at the port, and there is no difference between them. A canoe can take up to two persons and the total weight of the passenger must not exceed the maximum capacity of the canoe. We want to minimize the cost of this activity, so find the minimum number of canoe bars that can accommodate all passengers. Now please write a program that reads the maximum capacity of the canoe, the number of passengers and the weight of each passenger. According to the rules given, calculate the minimum number of canoe bars that must be placed for all passengers and output the results.

Input

The first line enters S, which represents the number of groups of test data;
The first row of each group of data includes two integers w,n,80<=w<=200,1<=n<=300,w is the maximum carrying capacity of a canoe, n is the number of people;
The next set of data is the weight of each person (not larger than the ship's carrying capacity);

Output

The minimum number of canoes required for each group of people.

Sample input

385 65 84 85 80 84 8390 390 45 60100 550 50 90 40 60

Sample output

533

1#include <iostream>2 using namespacestd;3#include <algorithm>4 BOOLCMP (intAintb)5 {6     returnA>b;7 }8 9 intpeoplenum[310];Ten intMain () One { A     intS,w,n,i,st,ed,count; -Cin>>s; -      while(s--) the     { -Count=0; -Cin>>w>>N; -          for(i=0; i<n;i++) +         { -Cin>>Peoplenum[i]; +         } ASort (peoplenum,peoplenum+n,cmp); at          for(st=0, ed=n-1; st<=ed;) -         { -             if(peoplenum[st]+peoplenum[ed]<=W) -             { -st++;ed--; -             } in             Else -st++; tocount++; +         } -cout<<count<<Endl; the     } *     return 0; $}

Nyoj 71 Canoe Trip (greedy)