初赛一:

1001 Drink:$\max\left\{\left\lceil\frac{m}{x}\right\rceil\cdot y\right\}$

 1 #include<cstdio>
 2 #include<algorithm>
 3 #define rep(i, l, r) for (int i = (l); i <= (r); i++)
 4 using namespace std;
 5 
 6 int T, n, m, x, y;
 7 
 8 int main(){
 9     freopen("drink.in", "r", stdin);
10     freopen("drink.out", "w", stdout);
11     for (scanf("%d", &T); T--; ) {
12         scanf("%d%d", &n, &m); int ans = 1e8;
13         rep(i, 1, n) scanf("%d%d", &x, &y), ans = min(ans, ((m - 1) / x + 1) * y);
14         printf("%d\n", ans);
15     }
16     return 0;
17 }
Drink

相关文章:

  • 2021-09-19
  • 2022-01-07
  • 2021-05-27
  • 2021-12-16
  • 2021-09-03
  • 2021-09-12
  • 2022-12-23
猜你喜欢
  • 2021-12-06
  • 2022-12-23
  • 2022-02-04
  • 2022-01-08
  • 2022-01-19
  • 2021-10-25
  • 2022-01-02
相关资源
相似解决方案