UVA11729_Commando War

最新推荐文章于 2023-12-02 13:59:34 发布

helloJeremy1996

最新推荐文章于 2023-12-02 13:59:34 发布

阅读量345

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 UVA c++ 贪心算法文章标签： C++ 算法 uva

本文链接：https://blog.youkuaiyun.com/helloJeremy1996/article/details/50542783

算法同时被 3 个专栏收录

43 篇文章

订阅专栏

c++

16 篇文章

订阅专栏

UVA

6 篇文章

订阅专栏

本文介绍了一个基于贪心算法的问题解决实例，通过C++实现了一种安排演讲者工作时间的优化方案，并强调了在编程竞赛中注意细节的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

基本的贪心算法

之前把要求输出的Case xxx写成小写case，一直没发现..结果都是wa，气炸了。所以，做题一定要细心来

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#define MAX(a,b) (a)>(b)?(a):(b)
using namespace std;

struct TimePoint{
	int speakTime;
	int workTime;
};
vector<TimePoint> timePoint;

bool cmp(TimePoint p1, TimePoint p2){
	return p1.workTime >= p2.workTime;
}
int main()
{
	int n,count=1;
	int i,curTime,tarTime;
	while (cin>>n && n!=0){
		i = curTime = tarTime= 0;		//initialize
		timePoint.clear();
		while (n--){
			TimePoint point;
			scanf("%d %d", &point.speakTime, &point.workTime);
			timePoint.push_back(point);
		}
		sort(timePoint.begin(), timePoint.end(), cmp);


		for (int j = 0; j < timePoint.size(); j++){
			curTime += timePoint[j].speakTime;
			tarTime = MAX(tarTime, curTime + timePoint[j].workTime);
		}
		cout << "Case " << count++ << ": " << tarTime << endl;
	}

	return 0;
}