HDU 2639
来源:互联网 发布:java主函数的写法 编辑:程序博客网 时间:2024/05/29 18:23
Bone Collector II
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 883 Accepted Submission(s): 411
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
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 883 Accepted Submission(s): 411
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
先全部存起来,再排序,再开一个数组遇到不同的就存起来。
#include <string.h>#include<stdio.h>#include<algorithm>using namespace std; int f[1005][35],temp[65];int w[105],c[105];int main(){ int t;scanf("%d",&t);while(t--){int n,vol,kth; scanf("%d%d%d",&n,&vol,&kth);int i,j,k,cns;for(i=0;i<n;i++) scanf("%d",&w[i]); for(i=0;i<n;i++) scanf("%d",&c[i]); memset(f,0,sizeof(f));for(i=0;i<n;i++){for(j=vol;j>=c[i];j--){ cns=0;for(k=0;k<kth;k++){ temp[cns++]=f[j][k];temp[cns++]=f[j-c[i]][k]+w[i];}sort(temp,temp+cns); int p=0;for(k=cns-1;k>=0;k--){if(p>=kth) break;if(k==cns-1 || temp[k]!=temp[k+1]) f[j][p++]=temp[k]; }}} printf("%d\n",f[vol][kth-1]);}return 0;}
- HDU 2639
- hdu 2639
- hdu 2639
- hdu 2639
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- Qt之qss文件编写
- FD
- SpringMVC深度探险(一) —— SpringMVC前传
- 用户空间缺页异常pte_handle_fault()分析--(上)
- UISearchBar 和 UISearchDisplayController的使用
- HDU 2639
- SpringMVC深度探险(二) —— SpringMVC概览
- 黑马程序员——打印菱形,打印等腰三角形
- 扩展欧几里德
- SpringMVC深度探险(三) —— DispatcherServlet与初始化主线
- UVA 10361
- SpringMVC深度探险(四) —— SpringMVC核心配置文件详解
- 一步一步使用Ext JS MVC与Asp.Net MVC 3开发简单的CMS后台管理系统之创建项目
- c++ 设计模式---结构型模式(用三句话讲清楚每一个模式)---1