acm之贪心算法题目5
来源:互联网 发布:在绿城工作怎么样知乎 编辑:程序博客网 时间:2024/05/18 00:47
Problem 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.
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.
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
5
代码:
#include<stdio.h>#include<string.h>#define max 1005struct he{ int time; int score;};bool f[max];int main(){ int t,n,i,min,j; he student[max],temp; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&student[i].time); for(i=0;i<n;i++) scanf("%d",&student[i].score); min=0; memset(f,0,sizeof(f)); for(i=0;i<n;i++) for(j=i+1;j<n;j++) { if(student[j].score>student[i].score) { temp=student[j]; student[j]=student[i]; } else if(student[j].score==student[i].score && student[j].time<student[i].time) { temp=student[j]; student[j]=student[i]; student[i]=temp; } } for(i=0;i<n;i++) { for(j=student[i].time;j>0;j--) { if(f[j]==false) { f[j]=true; break; } } if(j==0) min+=student[i].score; } printf("%d\n",min); } return 0;}
- acm之贪心算法题目5
- acm之贪心算法题目1
- acm之贪心算法题目2
- acm之贪心算法题目3
- acm之贪心算法题目4
- acm之贪心算法题目6
- acm之贪心算法题目7
- acm之贪心算法题目8
- acm之贪心算法题目9
- acm之贪心算法题目10
- acm之搜索题目5
- acm之递归题目5
- ACM贪心算法之活动安排以及算法证明
- ACM--贪心算法
- ACM 贪心算法
- 1004贪心算法acm
- 1006-贪心算法acm
- ACM 贪心算法详解
- PHP输出当前进程所有变量 / 常量 / 模块 / 函数 / 类
- Scikit-learn介绍几种常用的特征选择方法
- JVM堆内存设置原理
- MacBook pro iterm2 配色
- android listview 用法
- acm之贪心算法题目5
- windows上PHP中Apache+MySQL+PHP环境的搭建
- hadoop之Hbase简介
- 解决SourceInsight不能解析标准C函数问题
- Activiti部署的方式
- 复习(数据结构):线性表 : C:动态分配内存
- android include使用
- hibernate——onetoone (单向)
- eclipse 全文搜索查找字符串