TOJ 2043.Does This Make Me Look Fat?

题目链接：http://acm.tju.edu.cn/toj/showp2043.html

2043.   Does This Make Me Look Fat?

---

Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 591   Accepted Runs: 243

---

Introduction

As the host of a popular daytime television talk show, you are working through the details of an upcoming episode on dieting. Your guest is the controversial Dr. Kevorkian, who has recently invented his own weight-loss plan, "Do You Want To Diet?" that guarantees to reduce your body weight by 1 pound every day.

You have a number of dieters scheduled to be on the show who have all been using Dr. Kevorkian's new plan. You want to make the episode more dramatic by introducing your guests in decreasing order of their weights on the day of the show. The problem is that the forms you had them fill out only requested the following information: Name, Days on the diet, Weight at start of diet. Hopefully you can dredge up those long-forgotten math skills before the filming time tonight!

Input

Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.

A single data set has 3 components:

1. Start line - A single line, "START"
2. Dieter list - A series of 1 to 10 (inclusive) single lines consisting of three fields, with each field separated from the others by a single space:
   • Name - The dieter's first name. This will be a text string containing 1 to 20 (inclusive) alphanumeric characters (no spaces).
   • Days On Diet - The number of days the dieter has been on the "Do You Want To Diet" as of the day of the talk show. This will be a non-zero positive integer strictly less than 1000.
   • Starting Weight - The weight, in pounds, of the dieter just before starting the diet. This will be a non-zero positive integer strictly less than 10,000.
3. End line - A single line, "END"

Here are some facts that may be useful:

• All dieters lost exactly 1 pound every day they were on the diet, as advertised.
• Nobody stayed on the diet long enough to weigh less than 1 pound at the time of the show.
• All dieters in a given input set will have different weights on the day of the show.
• All dieters in a given input set will have different names.

Output

For each input data set, there will be exactly one output set, and there will be exactly one blank line separating output sets.

A single output set consists of a series of lines, each containing the Name of one of the dieters from the Dieter list. The list will be sorted in descending order according to weight at the time of the TV show. All dieters must be listed.

Sample Input

STARTJoe 10 110ENDSTARTJames 100 150Laura 100 140Hershey 100 130ENDSTARTHershey0 1 5Hershey2 1 3Hershey1 1 4Hershey3 1 2END

Sample Output

JoeJamesLauraHersheyHershey0Hershey1Hershey2Hershey3

Source: South Central USA 2001

---

Submit   List    Runs   Forum   Statistics

水题，一个专家发明了一个减肥食谱，它可以让人每天减肥1磅。给出一些使用这些食谱的人的姓名、使用时间以及使用食谱之前的重量，按目前体重从高到低的顺序输出这些人的名字。

解题思路：使用结构体存储每个减肥者的信息，按照体重减去天数自大到小排列即可。

#include <stdio.h>#include <iostream>#include <algorithm>using namespace std;struct diet{string Name;int day,weight; }Name[25]; bool cmp(diet a,diet b){return a.weight>b.weight;}int main(){int n=0;string state;bool flag=false;while(cin>>state){if(state=="START")continue;if(state=="END"){if(flag)cout<<'\n';flag=true;for(int i=0;i<n;i++)Name[i].weight-=Name[i].day;sort(Name,Name+n,cmp); for(int i=0;i<n;i++)cout<<Name[i].Name<<endl;n=0;continue;}cin>>Name[n].day>>Name[n].weight;Name[n].Name=state;n++;}}