#include <stdio.h> #include <stdint.h> void find_top_3(uint8_t *arr, uint8_t n) { // Your logic here // sort for(int i = 0; i < n; ++i) { int key = arr[i]; int j = i - 1; while (j >= 0 && arr[j] < key) { arr[j+1] = arr[j]; j--; } arr[j+1] = key; } if (n >= 3) { for(int i = 0; i < 3; ++i) { printf("%d ", arr[i]); } } else { for(int i = 0; i < n; ++i) { printf("%d ", arr[i]); } } } int main() { uint8_t n; scanf("%hhu", &n); uint8_t arr[100]; for (uint8_t i = 0; i < n; i++) { scanf("%hhu", &arr[i]); } find_top_3(arr, n); return 0; }
Test Cases
Test Results
Input
6 10 90 20 80 70 30
Expected Output
90 80 70