标签：
（这道麽。。。。英文题，，硬伤， 也是队友写的；题意是 从数据中找到与众不同的数据， 且该价钱是最低的（也就是竞标） 代码应该不难）；
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
1 #include<stdio.h> 2 #include<stdlib.h> 3 #include<string.h> 4 #include<ctype.h> 5 #define N 1010 6 #define max(a, b)(a > b ? a : b) 7 8 typedef struct node 9 { 10 char s[10]; 11 int p; 12 } node; 13 14 int cmp(const void *a, const void *b) 15 { 16 node *s1 = (node *)a, *s2 = (node *)b; 17 return s1->p - s2->p; 18 } 19 int main() 20 { 21 node node[N]; 22 int m, n, i, x, a[N]; 23 char str[N]; 24 while(scanf("%d%d", &m, &n) != EOF) 25 { 26 memset(a, 0, sizeof(a)); 27 for(i = 0 ; i < n ; i++) 28 { 29 scanf("%s%d", node[i].s, &node[i].p); 30 a[node[i].p]++; 31 } 32 qsort(node, n, sizeof(node[0]), cmp); 33 for(i = 0 ; i < n ; i++) 34 { 35 if(node[i].p <= m && a[node[i].p] == 1) 36 { 37 strcpy(str, node[i].s); 38 x = node[i].p; 39 break; 40 } 41 } 42 printf("The winner is %s\nThe price is %d\n", str, x); 43 } 44 return 0; 45 }
标签：
原文地址：http://www.cnblogs.com/yishilin/p/4476641.html
