https://vjudge.net/contest/357844#problem/G
按照扣分多少排序降序,如果扣分相同就按截止日期升序。假设截止日期当天写,例如4天就在第四天写,如果第四天已经有安排,就往前找到空余的日子安排进去
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
struct homework
{
int day;
int score;
}a[1100];
bool cmp( homework a,homework b)
{
if(a.score==b.score) return a.day<b.day;
return a.score>b.score;
}
int main()
{
int casee;
scanf("%d",&casee);
while(casee--)
{
int n,sum=0;
int tag[1100]={0};
scanf("%d",&n);
int mx=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].day);
if(a[i].day>mx) mx=a[i].day;
}
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].score);
sum+=a[i].score;
}
sort(a+1,a+n+1,cmp);
/*for(int i=1;i<=n;i++)
{
printf("%d %d\n",a[i].day,a[i].score);
}*/
for(int i=1;i<=n;i++)
{
if(tag[a[i].day]==0)
{
tag[a[i].day]=i;
}
else
{
for(int j=a[i].day;j>0;j--)
{
if(tag[j]==0)
{
tag[j]=i;
break;
}
}
}
}
int e=0;
for(int i=1;i<=mx;i++)
{
//printf("%d ",tag[i]);
e+=a[tag[i]].score;
}
printf("%d\n",sum-e);
}
return 0;
}