#include <stdio.h>
int main(void) {
//讀入資料
int grade[20];
int n;
for(int i=0;i<n;i++)
//泡沫排序法&印結果
int temp;
for(int i=n-2;i>=0;i--)
for(int j=0;j<=n-2;j++)
if(grade[j]>grade[j+1]){
temp=grade[j+1];
grade[j+1]=grade[j];
grade[j]=temp;
}
for(int i=0;i<n;i++)
//判斷不及格
int highestfail;
if(grade[0]>=60)
else{
for(int i=0;grade[i]<60&&i<n;i++)
highestfail=grade[i];
}
//判斷及格
int lowestpast;
if(grade[n-1]<60)
else{
for(int i=n-1; grade[i]>=60;i--)
lowestpast=grade[i];
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CgkvL+iugOWFpeizh+aWmQoJaW50IGdyYWRlWzIwXTsKCWludCBuOwoJc2NhbmYoIiVkIiwmbik7Cglmb3IoaW50IGk9MDtpPG47aSsrKQoJCXNjYW5mKCIlZCIsJmdyYWRlW2ldKTsKCQkKCS8v5rOh5rKr5o6S5bqP5rOV77yG5Y2w57WQ5p6cCglpbnQgdGVtcDsKCWZvcihpbnQgaT1uLTI7aT49MDtpLS0pCgkJZm9yKGludCBqPTA7ajw9bi0yO2orKykKCQkJaWYoZ3JhZGVbal0+Z3JhZGVbaisxXSl7CgkJCQl0ZW1wPWdyYWRlW2orMV07CgkJCQlncmFkZVtqKzFdPWdyYWRlW2pdOwoJCQkJZ3JhZGVbal09dGVtcDsKCQkJfQoJZm9yKGludCBpPTA7aTxuO2krKykKCQkoaSE9bi0xKT8JcHJpbnRmKCIlZCAiLGdyYWRlW2ldKToocHJpbnRmKCIlZCIsZ3JhZGVbaV0pKTsKCQoJLy/liKTmlrfkuI3lj4rmoLwJCglpbnQgaGlnaGVzdGZhaWw7CglpZihncmFkZVswXT49NjApCgkJcHJpbnRmKCJcbmJlc3QgY2FzZSIpOwoJZWxzZXsKCQlmb3IoaW50IGk9MDtncmFkZVtpXTw2MCYmaTxuO2krKykKCQkJaGlnaGVzdGZhaWw9Z3JhZGVbaV07CgkJcHJpbnRmKCJcbiVkIixoaWdoZXN0ZmFpbCk7Cgl9CgkKCQkvL+WIpOaWt+WPiuagvAkKCWludCBsb3dlc3RwYXN0OwoJaWYoZ3JhZGVbbi0xXTw2MCkKCQlwcmludGYoIlxud29yc3QgY2FzZSIpOwoJZWxzZXsKCQlmb3IoaW50IGk9bi0xOyBncmFkZVtpXT49NjA7aS0tKQoJCQlsb3dlc3RwYXN0PWdyYWRlW2ldOwoJCXByaW50ZigiXG4lZCIsbG93ZXN0cGFzdCk7Cgl9CglyZXR1cm4gMDsKfQo=