fork download
  1. #include <stdio.h>
  2.  
  3. int main(void) {
  4. //讀入資料
  5. int grade[20];
  6. int n;
  7. scanf("%d",&n);
  8. for(int i=0;i<n;i++)
  9. scanf("%d",&grade[i]);
  10.  
  11. //泡沫排序法&印結果
  12. int temp;
  13. for(int i=n-2;i>=0;i--)
  14. for(int j=0;j<=n-2;j++)
  15. if(grade[j]>grade[j+1]){
  16. temp=grade[j+1];
  17. grade[j+1]=grade[j];
  18. grade[j]=temp;
  19. }
  20. for(int i=0;i<n;i++)
  21. (i!=n-1)? printf("%d ",grade[i]):(printf("%d",grade[i]));
  22.  
  23. //判斷不及格
  24. int highestfail;
  25. if(grade[0]>=60)
  26. printf("\nbest case");
  27. else{
  28. for(int i=0;grade[i]<60&&i<n;i++)
  29. highestfail=grade[i];
  30. printf("\n%d",highestfail);
  31. }
  32.  
  33. //判斷及格
  34. int lowestpast;
  35. if(grade[n-1]<60)
  36. printf("\nworst case");
  37. else{
  38. for(int i=n-1; grade[i]>=60;i--)
  39. lowestpast=grade[i];
  40. printf("\n%d",lowestpast);
  41. }
  42. return 0;
  43. }
  44.  
Success #stdin #stdout 0.01s 5212KB
stdin
5
59 60 61 62 63
stdout
59 60 61 62 63
59
60