3.4 Max, Min Median, Sorting

ā§Š.ā§Ē āĻŦ⧜, āϛ⧋āϟ, āĻŽāĻ§ā§āϝāĻŽāĻž, āϏāĻ°ā§āϟāĻŋāĻ‚ (ā§Ģ)

  1. [18] āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŦ⧃āĻšāĻ¤ā§āϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

  2. [19] āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻ•ā§āώ⧁āĻĻā§āϰāϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

  3. [20] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŦ⧃āĻšāĻ¤ā§āϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

  4. [21] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻ•ā§āώ⧁āĻĻā§āϰāϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

  5. [22] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŽāĻ§ā§āϝāĻŦāĻ°ā§āϤ⧀ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

āϏāĻŽāĻžāϧāĻžāύ

[18] āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŦ⧃āĻšāĻ¤ā§āϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

#include<stdio.h>
int main(){
    int num1, num2;

    scanf("%d%d", &num1, &num2);

    if(num1 > num2){
        printf("%d\n", num1);
    }
    else{
        printf("%d\n", num2);
    }

    return 0;
}
Sample Input
Sample Output

5 8

8

15 10

15

20 20

20

[19] āĻĻ⧁āχāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻ•ā§āώ⧁āĻĻā§āϰāϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

#include<stdio.h>
int main(){
    int num1, num2;

    scanf("%d%d", &num1, &num2);

    if(num1 < num2){
        printf("%d\n", num1);
    }
    else{
        printf("%d\n", num2);
    }

    return 0;
}
Sample Input
Sample Output

5 8

5

15 10

10

20 20

20

[20] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŦ⧃āĻšāĻ¤ā§āϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

#include<stdio.h>
int main(){
    int num1, num2, num3;

    scanf("%d%d%d", &num1, &num2, &num3);

    if(num1 >= num2 && num1 >= num3){
        printf("%d\n", num1);
    }
    else if(num2 >= num1 && num2 >= num3){
        printf("%d\n", num2);
    }
    else{
        printf("%d\n", num3);
    }

    return 0;
}
Sample Input
Sample Output

5 8 3

8

15 10 20

20

12 12 5

12

[21] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻ•ā§āώ⧁āĻĻā§āϰāϤāĻŽ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

#include<stdio.h>
int main(){
    int num1, num2, num3;

    scanf("%d%d%d", &num1, &num2, &num3);

    if(num1 <= num2 && num1 <= num3){
        printf("%d\n", num1); 
    }
    else if(num2 <= num1 && num2 <= num3){
        printf("%d\n", num2);
    }
    else{
        printf("%d\n", num3);
    }

    return 0;
}
Sample Input
Sample Output

5 8 3

3

15 10 20

10

12 12 5

5

[22] āϤāĻŋāύāϟāĻŋ āϏāĻ‚āĻ–ā§āϝāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻŽāĻ§ā§āϝāĻŦāĻ°ā§āϤ⧀ āϏāĻ‚āĻ–ā§āϝāĻžāϟāĻŋ āύāĻŋāĻ°ā§āϪ⧟ āĻ•āϰāĨ¤

#include<stdio.h>
int main(){
    int num1, num2, num3;
    
    scanf("%d%d%d", &num1, &num2, &num3);

    if((num1 >= num2 && num1 <= num3) || (num1 <= num2 && num1 >= num3)){
        printf("%d\n", num1);
    }
    else if((num2 >= num1 && num2 <= num3) || (num2 <= num1 && num2 >= num3)){
        printf("%d\n", num2);
    }
    else{
        printf("%d\n", num3);
    }

    return 0;
}
Sample Input
Sample Output

5 8 3

5

15 10 20

15

12 5 7

7

Last updated