携程笔试
第二题代码:
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 a[i] = in.nextInt();
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i sum[i+1] = sum[i]+a[i];}
for(int i=0;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 int mid = left+(right-left)/2;
if(nums[mid] 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
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i
for(int i=0;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
if(nums[mid]
}
else if (nums[mid]>target) {
right = mid;
}
}
return right;
}
全部评论
相关推荐
04-16 22:46
门头沟学院 计算机类 点赞 评论 收藏
转发
04-16 20:55
哈尔滨工业大学(深圳) 点赞 评论 收藏
转发
投递虾皮信息等公司7个岗位 > 软件开发薪资爆料
点赞 评论 收藏
转发
点赞 评论 收藏
转发
04-09 16:19
门头沟学院 计算机类 点赞 评论 收藏
转发