/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 284.0 KiB
#2 Accepted 1ms 328.0 KiB
#3 Accepted 1ms 284.0 KiB
#4 Accepted 1ms 284.0 KiB
#5 Accepted 1ms 284.0 KiB
#6 Accepted 1ms 284.0 KiB

Code

#include<stdio.h>
int main()
{
    int n = 4;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
    int maxx = arr[0];
    int minn = arr[0];
    for (int i = 0; i < n; i++)
    {
        if (arr[i]>maxx)
        {
            maxx = arr[i];
        }
        
    }
    for (int i = 0; i < n; i++)
    {
        if (arr[i]<minn)
        {
            minn = arr[i];
        }
        
    }
    printf("%d\n%d", minn, maxx);
    
    
    
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1022 Minmax
Language
C99 (GCC 13.2.0)
Submit At
2024-05-06 17:51:41
Judged At
2024-11-11 03:31:51
Judged By
Score
100
Total Time
1ms
Peak Memory
328.0 KiB