HDOJ1425 sort【Hash】
Problem : 1425 ( sort ) Judge Status : Accepted
RunId : 7412949 Language : C Author : qq1203456195
Code Render Status : Rendered By HDOJ C Code Render Version 0.01 Beta
#include <stdio.h> #include <string.h> #include <stdlib.h> #define N 1000100 #define M 500000 int arr[1000100]; int main() { int m,n,i,tmp,max; while(scanf("%d%d",&m,&n)!=EOF) { memset(arr,0x3f3f3f3f,sizeof(arr)); max = -1*N; for (i = 0; i < m; i++) { scanf("%d",&tmp); arr[tmp+M] = tmp; max = max>(tmp+M)?max:(tmp+M); } for(i = max;i>=0 && n!=0;i--) { if(n!=0 && arr[i]!=0x3f3f3f3f) { printf("%d",arr[i]); n--; if(n == 0) printf("\n"); else printf(" "); } } } return 0; }
![字节跳动内推](https://img2020.cnblogs.com/blog/323808/202004/323808-20200415172728571-1992447742.jpg)
找我内推: 字节跳动各种岗位
作者:
ZH奶酪(张贺)
邮箱:
cheesezh@qq.com
出处:
http://www.cnblogs.com/CheeseZH/
*
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。