挑战性题目：

各位：
我想用B表中的数量，组成最有效率的求和组合来满足表A中的SLOTQTY.要求各求和组合最智能最接近A表的要求的数量。请问各位有什么好的方法。

要求：
1.列出每个Feeder用到的PartNo 数量组合
2，计算出最终用到的PartNo 行数
3，计算出哪些行是已经满足后，多出来的

求SQL!!!

表a：

Feeder Material SlotQty
1023 11-0995-01 70650
123 11-0995-01 76930
223 11-0995-01 80070
523 11-0995-01 78500
623 11-0995-01 78500

表b：

PartNo Qty GRN
11-0995-01 15000 9k1024675401001009
11-0995-01 7678 9k1024396031001008
11-0995-01 2516 9k1024920878001002
11-0995-01 11200 9k1024675401001017
11-0995-01 14555 9k1024396031002024
11-0995-01 5000 9k1024675401001008
11-0995-01 12000 9k1024675401001015
11-0995-01 321 9k1024675401001016
11-0995-01 16 9k1024675401001013
11-0995-01 89 9k1024675401001014
11-0995-01 13555 9k1025294786001009
11-0995-01 13547 9k1024417772001007
11-0995-01 12558 9k1024417772001008
11-0995-01 16000 9k1024417772001013
11-0995-01 15000 9k1024395720001004
11-0995-01 15000 9k1024396031002021
11-0995-01 15000 9k1024396031001005
11-0995-01 15000 9k1025294786001008
11-0995-01 15000 9k1024920991001004
11-0995-01 15000 9k1025294786001001
11-0995-01 15000 9k1025294358001010
11-0995-01 15000 9k1024350725001014
11-0995-01 15000 9k1024920993001004
11-0995-01 15000 9k1024920993001002
11-0995-01 15000 9k1024675401001006
11-0995-01 15000 9k1024396031001006
11-0995-01 15000 9k1024675401001007
11-0995-01 5193 9k1024393968001023
11-0995-01 15000 9k1024395720001003
11-0995-01 15000 9k1024396031002011
11-0995-01 15000 9k1024396031002014
11-0995-01 15000 9k1024920993001003
11-0995-01 15000 9k1024396031002010
11-0995-01 15000 9k1024920878001005

少来点数据，并且把你要的结果写出来

接近这种活不适合数据库里处理，程序里处理好些

高手请入，菜鸟止步！

where is 高手们？

where is 高手们？要是没人回复，我就一直发。

背包???

where is 高手们？