I - Doing Homework again
2024-10-18 00:44:23
I - Doing Homework again
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Description
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce
his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.
his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.
Input
The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced
scores.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced
scores.
Output
For each test case, you should output the smallest total reduced score, one line per test case.
Sample Input
3
3
3 3 3
10 5 1
3
1 3 1
6 2 3
7
1 4 6 4 2 4 3
3 2 1 7 6 5 4
Sample Output
0
3
5my answer:#include<iostream>
#include<algorithm>
using namespace std;
typedef struct st{
int day;
int score;
}st;
bool cmp(st a,st b){
return a.score>b.score;
}
int main()
{
int n,T;
cin>>T;
while(cin>>n)
{
st a[1000];
int vis[1000]={0};
for(int i=0;i!=n;i++)
cin>>a[i].day;
for(int i=0;i!=n;i++)
cin>>a[i].score;
int b[1000];
sort(a,a+n,cmp);
int sum=0;
for(int j=0;j<n;j++){
if(vis[a[j].day]){ int k=a[j].day;
while(k>0&&vis[k])k--;
if(k<=0){sum+=a[j].score;}
else vis[k]=1;
}
else
{
vis[a[j].day]=1;
}
}
cout<<sum<<endl;
}
return 0;
}
最新文章
- Visual Studio 2015 Pre Secondary Installer 在哪里
- JavaScript 学习小结
- jQuery知识点总结(第六天)
- Java创建目录 mkdir与mkdirs的区别
- PostgreSQL Replication之第十二章 与Postgres-XC一起工作(2)
- 用Qt图形视图框架开发拼图游戏
- Sprite的原点
- 下一个系列学习列表Spring.net+NHibernate+MVC
- hdu-5505(数论)
- Openfire 服务端在Eclipse上部署
- Java序列化接口的作用总结
- Bat 中特殊符号
- 谈谈我对Java中CallBack的理解
- 《白手起家Win32SDK应用程序》(完整版+目录)
- OCP-1Z0-051-名称解析-文章32称号
- Spring+SpringMVC+MyBatis深入学习及搭建(十五)——SpringMVC注解开发(基础篇)
- git中常用的指令
- webstom破解
- WARNING: REMOTE HOST IDENTIFICATION HAS CHANGED!问题
- Promise笔记