摘要: 寻找大富翁Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2459Accepted Submission(s): 1162Problem Description浙江桐乡乌镇共有n个人,请找出该镇上的前m个大富翁.Input输入包含多组测试用例.每个用例首先包含2个整数n(0#include#includeusing namespace std;int main(){ int n,m,i,j,a[100010],t; while(~scanf(& 阅读全文
posted @ 2013-09-22 20:31 我家小破孩儿 阅读(170) 评论(0) 推荐(1)