programming-challenges Shoemaker's Problem (110405) 题解
Greedy. 证明:Let'ssaywehavejob1,2,...,n,andtheyhavetimeandfineast1,f1,t2,f2,...,tn,fnandtheyareintheorderoft1/f1
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include