public class Solution
 {
     public static void main(String[] args)
     {
         int[] employee = new int[8];
         int[] totalTime = new int[8];
         int temp;

         int[][] detailTime =
         {
             {2, 4, 3, 4, 5, 8, 8},
             {7, 3, 4, 3, 3, 4, 4},
             {3, 3, 4, 3, 3, 2, 2},
             {9, 3, 4, 7, 3, 4, 1},
             {3, 5, 4, 3, 6, 3, 8},
             {3, 4, 4, 6, 3, 4, 4},
             {3, 7, 4, 8, 3, 8, 4},
             {6, 3, 5, 9, 2, 7, 9}
         };

         for(int i = 0; i < 8; i++)
         {
             for(int j = 0; j < 7; j++)
                 totalTime[i] += detailTime[i][j];
             employee[i] = i;
         }

         for(int i = 0; i < 8; i++)
         {
             for(int j = i; j < 8; j++)
             {
                 if(totalTime[j] > totalTime[i])
                 {
                     temp = totalTime[j];
                     totalTime[j] = totalTime[i];
                     totalTime[i] = temp;
                     temp = employee[i];
                     employee[i] = employee[j];
                     employee[j] = temp;
                 }
             }
         }

         for(int i = 0; i < 8; i++)
             System.out.println("Employee " + employee[i] + " work " + totalTime[i] + " hours");
     }
 }

HW7.4的更多相关文章

  1. HW7.18

    public class Solution { public static void main(String[] args) { int[][] m = {{1, 2}, {3, 4}, {5, 6} ...

  2. HW7.17

    import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner i ...

  3. HW7.16

    import java.util.Arrays; public class Solution { public static void main(String[] args) { int row = ...

  4. HW7.15

    public class Solution { public static void main(String[] args) { double[][] set1 = {{1, 1}, {2, 2}, ...

  5. HW7.14

    import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner i ...

  6. HW7.13

    import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner i ...

  7. HW7.12

    import java.util.Scanner; public class Solution { public static void main(String[] args) { double[] ...

  8. HW7.11

    import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner i ...

  9. HW7.10

    public class Solution { public static void main(String[] args) { int[][] array = new int[3][3]; for( ...

  10. HW7.9

    import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner i ...

随机推荐

  1. spoj 178

    输出相邻的点   比较简单吧....... #include <cstdio> #include <cstring> using namespace std; int main ...

  2. uva 624

    背包问题  总时间为容量,单个唱片时间为各个物体的价值与体积   f[] 用来记录路径 #include <cstdio> #include <cstring> #define ...

  3. XML 创建

    using unityEngine; using System.Collections; using System.Linq; using System.Xml.Linq; using System; ...

  4. Window Event 2008

    https://support.microsoft.com/en-us/kb/947226

  5. 2013 Multi-University Training Contest 5 Partition

    思路:五边形数定理!!! 五边形数定理是一个由欧拉发现的数学定理,描述欧拉函数展开式的特性.欧拉函数的展开式如下: 亦即 欧拉函数展开后,有些次方项被消去,只留下次方项为1, 2, 5, 7, 12, ...

  6. hdu 2509 Be the Winner 博弈论

    博弈论水题!!! 代码如下: #include<stdio.h> #include<iostream> using namespace std; int main(){ int ...

  7. android listview判断是否滑动到顶部还是底部

    listView.setOnScrollListener(new AbsListView.OnScrollListener() { @Override public void onScrollStat ...

  8. 12 求1+2+...+n

    参考 http://www.cppblog.com/zengwei0771/archive/2012/04/28/173014.html 和 http://blog.csdn.net/shiren_b ...

  9. [itint5]两有序数组的交和并

    这一题也简单,唯一有意思的地方是提炼了一个函数用来做数组索引去重前进. int forward(vector<int> &arr, int i) { while (i+1 < ...

  10. java Collections.sort()实现List排序的默认方法和自定义方法

    1.java提供的默认list排序方法 主要代码: List<String> list = new ArrayList();list.add("刘媛媛"); list. ...