pat 1033. To Fill or Not to Fill (25)

貪婪算法web #include<stdio.h> #include<algorithm> #define SIZE 501 #define INF 0x7fffffff using std::sort; struct gas{ double price; int dist; } station[SIZE]; bool cmp(const struct gas &a, const

>>阅读原文<<