HDU 1789 Doing Homework again(贪心)

////  main.cpp//  Richard////  Created by 邵金杰 on 16/9/15.//  Copyright © 2016年 邵金杰. All rights reserved.//#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int maxn=1000+10;struct node{    int t,w;    bool operator < (const node &e) const{        return w>e.w;    }}v[maxn];int vis[maxn];int main(){    int t;    scanf("%d",&t);    while(t--)    {        memset(vis,0,sizeof(vis));        int n,sum=0;        scanf("%d",&n);        for(int i=0;i<n;i++) scanf("%d",&v[i].t);        for(int i=0;i<n;i++) {scanf("%d",&v[i].w);sum+=v[i].w;}        sort(v,v+n);        for(int i=0;i<n;i++)        {            int p=v[i].t;            while(vis[p]) p--;            if(p) {vis[p]=1;sum-=v[i].w;}        }        cout<<sum<<endl;    }    return 0;}