这篇博客讨论了一个有趣的问题，如何在2500头奶牛中，利用不超过2500瓶不同SPF值的防晒霜，使得最多数量的奶牛能在沙滩上晒太阳而不被晒伤。每头奶牛都有一个SPF值的接受范围，如果防晒霜的SPF值不合适，要么会晒伤，要么无法晒黑。输入包括奶牛的数量、防晒霜瓶子数及每头奶牛和每个瓶子的SPF范围，输出是能保护晒太阳的最大奶牛数。示例给出了32头奶牛和特定的SPF需求，以及防晒霜瓶子的SPF和覆盖范围，结果显示最多2头奶牛可以得到合适的防晒保护。
To avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows must cover her hide with sunscreen when they’re at the beach. Cow i has a minimum and maximum SPF rating (1 ≤ minSPFi ≤ 1,000; minSPFi ≤maxSPFi ≤ 1,000) that will work. If the SPF rating is too low, the cow
suffers sunburn; if the SPF rating is too high, the cow doesn’t tan at all…The cows have a picnic basket with L (1 ≤ L ≤ 2500) bottles of sunscreen lotion, each bottle i with an SPF rating SPFi (1 ≤ SPFi ≤ 1,000). Lotion bottle i can cover coveri cows with lotion. A cow may lotion from only one bottle.
What is the maximum number of cows that can protect themselves while tanning given the available lotions?
Input
- Line 1: Two space-separated integers: C and L
- Lines 2…C+1: Line i describes cow i’s lotion requires with two integers: minSPFi and maxSPFi
- Lines C+2…C+L+1: Line i+C+1 describes a sunscreen lotion bottle i with space-separated integers: SPFi and coveri
Output
A single line with an integer that is the maximum number of cows that
can be protected while tanning
Sample Input
3 2
3 10
2 5
1 5
6 2
4 1
Sample Output
2
扫一扫
11万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
