携程笔试
第二题代码:
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
int[] b = new int[n];
for(int i=0;i<n;i++){
a[i] = in.nextInt();
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i<n;i++){
sum[i+1] = sum[i]+a[i];}
for(int i=0;i<b.length;i++){
int j =findIndex(a,b[i]);
long left =(long) b[i]*j-sum[j];
long right=sum[n]-sum[j]-(long) b[i]*(n-j);
System.out.println(left+right);}
}
public static int findIndex(int[] nums, int target){
int left=-1,right=nums.length;
while(left+1<right){
int mid = left+(right-left)/2;
if(nums[mid]<target){
left=mid;
}
else if (nums[mid]>target) {
right = mid;
}
}
return right;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
int[] b = new int[n];
for(int i=0;i<n;i++){
a[i] = in.nextInt();
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i<n;i++){
sum[i+1] = sum[i]+a[i];}
for(int i=0;i<b.length;i++){
int j =findIndex(a,b[i]);
long left =(long) b[i]*j-sum[j];
long right=sum[n]-sum[j]-(long) b[i]*(n-j);
System.out.println(left+right);}
}
public static int findIndex(int[] nums, int target){
int left=-1,right=nums.length;
while(left+1<right){
int mid = left+(right-left)/2;
if(nums[mid]<target){
left=mid;
}
else if (nums[mid]>target) {
right = mid;
}
}
return right;
}
全部评论
相关推荐
点赞 评论 收藏
分享
03-24 10:25
南京信息工程大学 嵌入式工程师 投票
这些sm私企真够逆天的,都春招了让我再去实习,那我到底还找不找工作,在你们公司工位上一边实习一边面试吗?实习完你要是不给转正,那我不白实习了。又想吃应届生红利,又想压榨每一个应届生,sm私企真够逆天的
点赞 评论 收藏
分享

点赞 评论 收藏
分享