Doing Homework again(dp)
2013-04-20 15:58
183 查看
Doing Homework again
// File Name: hdu1789.cpp// Author: rudolf
// Created Time: 2013年04月20日 星期六 15时52分23秒
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<string.h>
using namespace std;
const int maxn=1005;
bool used[maxn];
struct node
{
int d,s;
}edge[maxn];
bool cmp(const node a,const node b)
{
if(a.s==b.s)
return a.d<b.d;
return a.s>b.s;
}
int main()
{
int t,n;
int i,j;
cin>>t;
while(t--)
{
cin>>n;
// memset(used,false,sizeof(used[0]));
for(i=0;i<n;i++)
cin>>edge[i].d;
for(i=0;i<n;i++)
cin>>edge[i].s;
sort(edge,edge+n,cmp);
memset(used,false,sizeof(used));
int ans=0;
for(i=0;i<n;i++)
{
for(j=edge[i].d;j>0;j--)
{
if(!used[j])
{
used[j]=true;
break;
}
}
if(j==0)
ans+=edge[i].s;
}
cout<<ans<<endl;
}
return 0;
}
相关文章推荐
- Doing Homework again - HDU 1789 背包dp
- HDU 1789 Doing Homework again(排序,DP)
- Doing Homework again(dp)
- HDU 1789 Doing Homework again 贪心 DP
- HDU 1074 Doing Homework(状态压缩dp)
- hdu 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again - 有点小感悟
- HDU 1074 Doing Homework(状态压缩DP)
- hdoj 1789 Doing Homework again
- hdu1789_Doing Homework again
- Doing Homework again
- hdu 1789 Doing Homework again (贪心)
- Doing Homework again(贪心)
- hdu 1789 Doing Homework again
- hdoj problem 1789 Doing Homework again(贪心问题+优先队列)
- HDU 1789 Doing Homework again 经典贪心
- Doing Homework again
- HDU 1789 Doing Homework again
- HDU 1074 Doing Homework【状态压缩DP】