Minimum Scalar Product(2008 Round1A A)
来源:互联网 发布:matlab根据数据求函数 编辑:程序博客网 时间:2024/04/29 09:14
有两个向量 v1=(x1, x2, ..., xn)和 v2=(y1, y2, ..., yn),允许任意交换 v1 和 v2 各自的分量的顺序。请计算 v1 和 v2 的内积 x1y1+...+xnyn 的最小值。import java.util.Arrays;import java.util.Collections;import java.util.Scanner;public class MinimunScalarProduct {public static void main(String[] args){Scanner s = new Scanner(System.in);int n = s.nextInt();s.nextLine();String[] a = s.nextLine().split(" ");String[] b = s.nextLine().split(" ");Arrays.sort(a);Arrays.sort(b,Collections.reverseOrder());int count =0;for(int i=0;i<a.length;i++){count += Integer.parseInt(a[i])*Integer.parseInt(b[i]);}System.out.println(count);}}
- Minimum Scalar Product(2008 Round1A A)
- GCJ 2008 Round1A A Minimum Scalar Product
- GCJ 2008 Round1A Problem A. Minimum Scalar Product
- Minimum Scalar Product(GCJ 2008 Round1A A)数学问题+贪心
- 125_minimum scalar product (2008 round1A A)
- Code Jam 2008 Round1A Problem A. Minimum Scalar Product —— 贪心
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product
- GCJ 2008 Round 1A A - Minimum Scalar Product (贪心)
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product
- 2008 Round1AA Minimum Scalar Product
- GCJ 2008 Round 1A Minimum Scalar Product
- (code jam)Problem A. Minimum Scalar Product
- Code jam Problem A. Minimum Scalar Product
- Minimum Scalar Product
- Minimum Scalar product
- GCJ Round 1A 2008 Problem A. Minimum Scalar Product(YY)
- 挑战2.7.1 Round 1A 2008 A. Minimum Scalar Product 贪心
- Google code jam: Problem A. Minimum Scalar Product
- spring的@Transactional()用
- NM_CUSTOMEDRAW(OnCustomDraw),WM_DRAWITEM(OnDrawItem)和DrawItem(DrawItem)的讨论
- 【leetcode】Reverse Nodes in k-Group
- 机房收费系统之结账
- VB6.0之Collection---Collection集合类
- Minimum Scalar Product(2008 Round1A A)
- 在JNI 编程中避免内存泄漏
- 在Spring3中使用注解(@Scheduled)创建计划任务
- 最长无重复子字符串
- Ubuntu 安装 Bumblebee
- CentOS网络配置解决方案
- POJ 1458 & HDU 1159 - Common Subsequence(最长公共子序列)
- 机房收费系统——组合查询
- 水平集(Level Set)的基本方法