zoj 3202
2009-10-05 12:46
204 查看
//3202 optimize 不使用数组,找出最大和次大的数,并记录最大数的位置 #include <iostream> using namespace std; int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); int max1=-1; int max2; scanf("%d",&max2); int t; int f=0; for(int i = 1 ; i <n; i++) { scanf("%d",&t); if(t>max2) { if(max2>max1) max1 = max2; f = i; max2 = t; } else if(t>max1) max1 = t; } printf("%d %d/n",f+1,max1); } return 0; }Second-price Auction
Time Limit: 1 Second Memory Limit: 32768 KB
Do you know second-price auction? It's very simple but famous. In a second-price auction, each potential buyer privately submits, perhaps in a sealed envelope or over a secure connection, his (or her) bid for the object to the auctioneer. After receiving all the bids, the auctioneer then awards the object to the bidder with the highest bid, and charges him (or her) the amount of the second-highest bid.
Suppose you're the auctioneer and you have received all the bids, you should decide the winner and the amount of money he (or she) should pay.
Input
There are multiple test cases. The first line of input contains an integer T(T <= 100), indicating the number of test cases. Then T test cases follow.
Each test case contains two lines: The first line of each test case contains only one integer N, indicating the number of bidders. (2 <= N <= 100) The second line of each test case contains N integers separated by a space. The i-th integer Pi indicates the i-th bidder's bid. (0 < Pi <= 60000) You may assume that the highest bid is unique.
Output
For each test case, output a line containing two integers x and y separated by a space. It indicates that the x-th bidder is the winner and the amount of money he (or she) should pay is y.
Sample Input
2 3 3 2 1 2 4 9
Sample Output
1 2 2 4//3202 #include <iostream> using namespace std; int cmp(const void *a , const void *b) { return -(*(int*)a-*(int*)b); } int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); int max=0; int f; int *a = new int ; for(int i = 0 ; i <n; i++) { scanf("%d",&a[i]); if(a[i]>max) { f = i; max = a[i]; } } qsort(a,n,sizeof(a[0]),cmp); printf("%d %d/n",f+1,a[1]); } return 0; }
相关文章推荐
- zoj 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- ZOJ-3202
- ZOJ 3202 (A)
- ZOJ Problem Set - 3202 Second-price Auction
- ZOJ 3202
- ZOJ 3202 Second-price Auction(排序)
- ZOJ 3202 Second-price Auction
- ZOJ 3202 Second-price Auction (A)
- ZOJ 3202 Second-price Auction
- ZOJ-3202-Second-price Auction【6th浙江省赛】
- ZOJ 3202 Second-price Auction (模拟)
- zoj_2136Longest Ordered Subsequence
- zoj 2297 Survival 状压dp
- zoj - 1094 - Matrix Chain Multiplication
- ZOJ 3278 8G Island (二分套二分)
- zoj 1002 Fire Net
- zoj 2587 Unique Attack 【判断最小割是否唯一】
- ZOJ题目分类,适合各种难度等级训练
- zoj 3735 概率dp