zoukankan      html  css  js  c++  java
  • hdu2639

    Bone Collector II

    Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1842    Accepted Submission(s): 952


    Problem Description
    The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,I will give you a link:

    Here is the link:http://acm.hdu.edu.cn/showproblem.php?pid=2602

    Today we are not desiring the maximum value of bones,but the K-th maximum value of the bones.NOTICE that,we considerate two ways that get the same value of bones are the same.That means,it will be a strictly decreasing sequence from the 1st maximum , 2nd maximum .. to the K-th maximum.

    If the total number of different values is less than K,just ouput 0.
     
    Input
    The first line contain a integer T , the number of cases.
    Followed by T cases , each case three lines , the first line contain two integer N , V, K(N <= 100 , V <= 1000 , K <= 30)representing the number of bones and the volume of his bag and the K we need. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.
     
    Output
    One integer per line representing the K-th maximum of the total value (this number will be less than 231).
     
    Sample Input
    3
    5 10 2
    1 2 3 4 5
    5 4 3 2 1
    5 10 12
    1 2 3 4 5
    5 4 3 2 1
    5 10 16
    1 2 3 4 5
    5 4 3 2 1
     
    Sample Output
    12
    2
    0
     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<algorithm>
     4 using namespace std;
     5 int f[1020][1020];
     6 int main()
     7 {
     8     int i,j,n,k,m,t,tt,v[1020],va[1020],tmp[1020],cnt,x;
     9     scanf("%d",&t);
    10     while(t--)
    11     {
    12         scanf("%d%d%d",&n,&m,&tt);
    13         for(i=1; i<=n; i++)
    14             scanf("%d",&va[i]);
    15         for(i=1; i<=n; i++)
    16             scanf("%d",&v[i]);
    17         memset(f,0,sizeof(f));
    18         for(i=1; i<=n; i++)
    19         {
    20             for(j=m; j>=v[i]; j--)
    21             {
    22                 cnt=0;
    23                 memset(tmp,0,sizeof(tmp));
    24                 for(k=1;k<=tt;k++)
    25                 {
    26                     tmp[cnt++]=f[j][k];
    27                     tmp[cnt++]=f[j-v[i]][k]+va[i];
    28                 }
    29                 sort(tmp,tmp+cnt);
    30                 x=1;
    31                 for(k=cnt-1;k>=0;k--)
    32                 {
    33                     if(x>tt)
    34                     break;
    35                     if(k==cnt-1||tmp[k]!=tmp[k+1])
    36                     f[j][x++]=tmp[k];
    37                 }
    38             }
    39         }
    40         printf("%d
    ",f[m][tt]);
    41     }
    42     return 0;
    43 }
  • 相关阅读:
    神奇的flex布局
    reset、revert、rebase
    Vue.filter过滤器
    moment.js时间格式化总结
    Vue之组件大全
    过滤器filter
    Vue之animate
    Vue之axios
    Mac OS系统上测试PHP代码前的准备工作 | 使用XAMPP搭建Apache服务器的步骤
    Python中的标识符、关键字、变量、语句、注释、模块
  • 原文地址:https://www.cnblogs.com/lxm940130740/p/3572538.html
Copyright © 2011-2022 走看看