Ants acmclub.com 10913 // poj 1852
2014-10-16 00:12
344 查看
#include<iostream> #include<algorithm> #include<cstdio> using namespace std; int shu[1000010]; int main(){ int i,a,b; while(scanf("%d %d",&a,&b)!=EOF){ for( i=0;i<a;i++) scanf("%d",&shu[i]); sort(shu,shu+a); while(--b) printf("%d ",shu[--i]); printf("%d\n",shu[--i]); } return 0; }
相关文章推荐
- [ACM] POJ 1852 Ants
- [ACM] POJ 1852 Ants
- Lake Counting (Poj 2386 // hzu.acmclub.com 11448)
- ACM:POJ-1852 Ants
- poj 1852 Ants
- poj 1852 ants
- POJ1852 Ants
- poj 1852 Ants
- POJ 1852 ants
- 1027:电子钟 Form sdjzu.acmclub.com
- poj 1852 Ants 【思维】
- Ants poj 1852
- POJ - 1852 Ants
- [POJ1852]Ants
- poj 1852 Ants
- poj 1852 Ants_贪心
- poj1852_Ants(弹性碰撞问题)
- poj 1852 ants
- POJ 1852 Ants
- 【POJ】1852 - Ants(数学问题,思路)