Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.InputStreamReader;
- public class Homework {
- static int minBrojKazneni(int a[]) {
- // Vasiot kod tuka
- for(int i = 0; i < a.length - 1; i++)
- for(int j = i + 1; j < a.length; j++){
- int temp;
- if(a[j] < a[i]){
- temp = a[j];
- a[j] = a[i];
- a[i] = temp;
- }
- }
- // int min = 0, n = a.length;
- // for(int i = 0; i < a.length; i++, n--)
- // min = min + a[i]*n;
- // return min;
- // the way bellow is the dynamic way to solve the problem
- int min = a[0], pred = a[0];
- for(int i = 1; i < a.length; i++) {
- min = min + pred + a[i];
- pred = pred + a[i];
- }
- return min;
- }
- public static void main(String[] args) throws Exception {
- int i;
- BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
- int N = Integer.parseInt(br.readLine());
- int a[] = new int[N];
- for (i=0;i<N;i++)
- a[i] = Integer.parseInt(br.readLine());
- int rez = minBrojKazneni(a);
- System.out.println(rez);
- br.close();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement