nyoj 251 AMAZING AUCTION 第三届河南省赛

Recently the auction house has introduced a new type of auction, the lowest price auction. In this new system, people compete for the lowest bid price, as opposed to what they did in the past. What an amazing thing! Now you could buy cool stuff with one penny. Your task is to write the software to automate this auction system. 

First the auctioneer puts an upper limit on bid price for each item. Only positive price less than or equal to this price limit is a valid bid. For example, if the price limit is 100, then 1 to 100, inclusive, are all valid bid prices. Bidder can not put more than one bid for the same price on a same item. However they can put many bids on a same item, as long as the prices are different. 

After all bids are set, the auctioneer chooses the winner according to the following rules:

(1). If any valid price comes from only one bidder, the price is a "unique bid". If there are unique bids, then the unique bid with the lowest price wins. This price is the winning price and the only bidder is the winning bidder.

(2). If there are no unique bids, then the price with fewest bids is the winning bid. If there are more than one price which has the same lowest bid count, choose the lowest one. This price is the winning price. The bidder who puts this bid first is the winning bidder. 

Given the price limit and all the bids that happen in order, you will determine the winning bidder and the winning price. 

输入

There are multi test cases.EOF will terminate the input.
The first line contains two integers: U (1 <= U <= 1000), the price upper limit and M (1 <= M <= 100), the total number of bids. M lines follow, each of which presents a single bid. The bid contains the bidder's name (consecutive non-whitespace characters<=5) and the price P (1 <= P <= U), separated with a single space. All bids in the input are guaranteed to be valid ones.

输出

Print the sentence "The winner is W" on the first line, and "The price is P" on the second.

样例输入

30 7  

Mary 10  

Mary 20

Mary 30

Bob 10

Bob 30

Carl 30

Alice 23

样例输出

The winner is Mary

The price is 20

题意：我觉得只要理解题意，这道题A掉无障碍啊，就是说有一个big,赢家要有两种情况，第一就是说所有可能的价格（1~U）都是同一个人出的，第二个就是说出现次数最少的价格的出价人为赢家。如果有两个价格相同的话，价格低的为赢家（第二个已经包括第一种了）

就是一个结构体排序问题

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct note
{
  char name[10];
  int price;
  int cas;
}w[101];
int cmp(note a,note b)
{
    if(a.cas!=b.cas)
      return a.cas<b.cas;
    else
      return a.price<b.price;
}
int main()
{
  int u,t;
  int i,j;
  while(scanf("%d%d",&u,&t)!=EOF)
  {
    for(i=0;i<t;i++)
    {
      scanf("%s%d",w[i].name,&w[i].price);
      w[i].cas=1;
      for(j=0;j<i;j++)
      {
        if(w[i].price==w[j].price)
        {
            w[j].cas++;
            w[i].cas=w[j].cas;
        }
      }
      }
      sort(w,w+t,cmp);
      printf("The winner is %s\n",w[0].name);
      printf("The price is %d\n",w[0].price);
  }
}