Hdu2844 multiple Coins backpacks

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      
        # Include
       # Define inf 0x3f3f3f # define ll _ int64using namespace std; int n, m, dp [100010], a [100010], c [1010]; void pack01 (int cost, int w) {for (int I = m; I >= cost; I --) dp [I] = max (dp [I-cost] + w, dp [I]);} void packall (int cost, int w) {for (int I = cost; I <= m; I ++) dp [I] = max (dp [I-cost] + w, dp [I]);} void multipack (int cost, int w, int cnt) {if (cost * cnt> = m) // The volume multiplied by the quantity is greater than the total volume, which means that the packall (cost, w) is not fully loaded, which is equivalent to infinite parts ); else // you can complete the loading, with 01 backpack {int I = 1; while (I