CF1200B 解法: 贪心.当在第i列时,尽可能多的取走第i列的木块使得袋子里的木块尽可能多 CODE: #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int N = 1e3 + 5; int n,m,k,T,h[N]; int main() { scanf("%d",&T)…