zoukankan      html  css  js  c++  java
  • 3.1.2 Score Inflation

    Score Inflation

    The more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as possible, and would like your assistance.

    We have several categories from which problems can be chosen, where a "category" is an unlimited set of contest problems which all require the same amount of time to solve and deserve the same number of points for a correct solution. Your task is write a program which tells the USACO staff how many problems from each category to include in a contest so as to maximize the total number of points in the chosen problems while keeping the total solution time within the length of the contest.

    The input includes the length of the contest, M (1 <= M <= 10,000) (don't worry, you won't have to compete in the longer contests until training camp) and N, the number of problem categories, where 1 <= N <= 10,000.

    Each of the subsequent N lines contains two integers describing a category: the first integer tells the number of points a problem from that category is worth (1 <= points <= 10000); the second tells the number of minutes a problem from that category takes to solve (1 <= minutes <= 10000).

    Your program should determine the number of problems we should take from each category to make the highest-scoring contest solvable within the length of the contest. Remember, the number from any category can be any nonnegative integer (0, one, or many). Calculate the maximum number of possible points.

    PROGRAM NAME: inflate

    INPUT FORMAT

    Line 1: M, N -- contest minutes and number of problem classes
    Lines 2-N+1: Two integers: the points and minutes for each class

    SAMPLE INPUT (file inflate.in)

    300 4
    100 60
    250 120
    120 100
    35 20
    

    OUTPUT FORMAT

    A single line with the maximum number of points possible given the constraints.

    SAMPLE OUTPUT (file inflate.out)

    605
    

    (Take two problems from #2 and three from #4.) 

    /*
    ID: makeeca1
    PROG: inflate
    LANG: C++
    */
    #include <cstdio>
    #define min(x,y) (x<y?x:y)
    #define MAX 10010
    #define max(x,y) (x>y?x:y)
    using namespace std;
    int a[MAX],v[MAX],f[MAX],vmax,n,ans;
    int main(){
        freopen("inflate.in","r",stdin);
        freopen("inflate.out","w",stdout);
        scanf("%d%d",&vmax,&n);
        for (int i=0;i<n;i++) scanf("%d%d",&v[i],&a[i]);
        for (int i=0;i<n;i++)
            for (int j=a[i];j<=vmax;j++)
                f[j]=max(f[j-a[i]]+v[i],f[j]);
        printf("%d
    ",f[vmax]);
        return 0;
    }
  • 相关阅读:
    mysql存储过程 --游标的使用 取每行记录 (多字段)
    mysql rowid实现
    redis进程守护脚本
    CF1042B 【Vitamins】(去重,状压搜索)
    CF1042A 【Benches】(优先队列)
    魔板 Magic Squares(广搜,状态转化)
    解方程(hash,秦九韶算法)
    noip模拟赛 动态仙人掌(并查集,贪心)
    (暴力碾标算)NOIP模拟赛 宗教仪式
    牛客网NOIP赛前集训营-提高组18/9/9 A-中位数
  • 原文地址:https://www.cnblogs.com/makeecat/p/3288961.html
Copyright © 2011-2022 走看看