NYOJ251 AMAZING AUCTION

AMAZING AUCTION

时间限制：3000 ms  |  内存限制：65535 KB

难度：4

描述

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

来源

第三届河南省程序设计大赛

上传者

ACM_赵铭浩

说一下题意，就是有一个奇怪的竞拍，奇怪就奇怪在它的竞拍规则上

竞拍规则：如果有只出现一次的价格就把其中最小的输出

                    如果没有只出现一次的，就找出其中的最小价格，并按第一次出现的输出

还有一点就是拍卖的价格超过给定的最大拍卖价格是无效的

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{    char name[10];    int num;    int p;}a[105],t;int cmp(node a,node b){    if(a.p==b.p)        return a.num<b.num;    return a.p<b.p;}int main(){    int u,m;    while(scanf("%d %d",&u,&m)!=EOF)    {        int i,j,len=0,ss,b[1005];        char s[10];        memset(b,0,sizeof(b));        for(i=0;i<m;i++)        {            scanf("%s %d",s,&ss);            if(ss<=u)            {                strcpy(a[len].name,s);                a[len].p=ss;                a[len].num=len;                len++;            }        }        sort(a,a+len,cmp);        int maxn=0;        for(i=0;i<len;i++)            b[a[i].p]++;        int flag=0;        for(i=0; i<len; i++)            if(b[a[i].p]==1)            {                printf("The winner is %s\n",a[i].name);                printf("The price is %d\n",a[i].p);                flag=1;                break;            }        if(flag==0)        {            printf("The winner is %s\n",a[0].name);            printf("The price is %d\n",a[0].p);        }    }    return 0;}