Advertisement
Guest User

Untitled

a guest
Jul 28th, 2017
51
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. public static void main(String[] args) {
  2. // TODO Auto-generated method stub
  3.  
  4. Scanner in = new Scanner(System.in);
  5. int n = in.nextInt();
  6. in.nextLine();
  7. int effort = 0, temp;
  8. int pos = in.nextInt();
  9. in.nextLine();
  10. int[] arr = new int[n];
  11. for (int i = 0; i < n; i++) {
  12. arr[i] = in.nextInt();
  13. }
  14.  
  15. int p = findlargest(arr);
  16. for (int i = 0; i < n; i++) {
  17. for (int j = 1; j < n; j++) {
  18. if (arr[i] > arr[j]) {
  19. if (p != i || p != j) {
  20. effort += (arr[i] * arr[j]);
  21. temp = arr[i];
  22. arr[i] = arr[j];
  23. arr[j] = temp;
  24. }
  25. }
  26. }
  27. }
  28.  
  29.  
  30. }
  31.  
  32. public static int findlargest(int[] arr) {
  33. int max = arr[0];
  34. int pos = 0;
  35. for (int i = 1; i < arr.length; i++) {
  36.  
  37. if (arr[i] > max) {
  38. max = arr[i];
  39. pos = i;
  40. }
  41.  
  42. }
  43. return (pos);
  44.  
  45. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement