打表
要注意不到7月前和8月后的情况
同时注意“0号”等特殊情况

<pre style="background-color:#fff">#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
using namespace std;

#define REP(n) for(int o=0;o&lt;n;o++)


class LOVE {
private:
 static const int maxn = 25;
 int M, N;
 struct node {
 int T, V;
 double p;
 }paper[maxn];

 static bool compare_node(node a, node b) {
 return a.p &gt; b.p;
 }

public:
 bool Do() {
 scanf(&#34;%d%d&#34;, &amp;M, &amp;N);
 if (M == 0 &amp;&amp; N == 0)return false;
 REP(M) {
 int T, V;
 scanf(&#34;%d%d&#34;, &amp;T, &amp;V);
 paper[o].T = T;
 paper[o].V = V;
 paper[o].p = (double)V / (double)T;
 }

 sort(paper, paper + M, compare_node);

 //REP(M)
 //printf(&#34;T=%d V=%d p=%f\n&#34;, paper[o].T, paper[o].V, paper[o].p);

 double ans = 0;
 for (int i = 0; i &lt; M; i++) {
 int temp = N - paper[i].T;
 ans += paper[i].V;
 if (temp &lt; 0) {
 ans += temp*paper[i].p;
 break;
 }
 N = temp;
 }

 printf(&#34;%.2f\n&#34;, ans);
 return true;
 }
};

int main() {
 LOVE LIVE;
 while (LIVE.Do());
 return 0;
}
</pre>

AOJ 2.Home Work