Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #define MAX 100
- int minBrojKazneni(int a[], int N) {
- //Vasiot kod tuk
- int i,j;
- int t=0;
- int suma=0;
- for(i=0; i<N; i++)
- {
- for(j=0; j<N-i-1; j++)
- {
- if( a[j] > a[j+1])
- {
- t = a[j];
- a[j] = a[j+1];
- a[j+1] = t;
- }
- }
- }
- int b[N];
- b[0]=a[0];
- for(i=1;i<N;i++)
- {
- b[i]=b[i-1]+a[i];
- }
- for(i=0;i<N;i++)
- {
- suma+=b[i];
- }
- return suma;
- }
- int main() {
- int i, N;
- int a[MAX];
- scanf("%d", &N);
- for (i=0;i<N;i++)
- scanf("%d", &a[i]);
- int res = minBrojKazneni(a, N);
- printf("%d\n", res);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement