需要找到性價比最高的電腦(它的價格比某臺電腦低,但質量更好),因此我首先寫了雙重循環(小函數調用),結果
顯示Time limit exceeded on test 6def lalala(price,quality,start_index,n):
for i in range(start_index,n):
if price[start_index] < price[i] and quality[start_index] > quality[i]:
return True
return False
n = int(raw_input())
price = []
quality=[]
for i in range(n):
line = map(int,raw_input().split())
price.append(line[0])
quality.append(line[1])
result = False
for i in range(n):
result = lalala(price,quality,i,n)
if result == True:
break
if result == True:
print "Happy Alex"
else:
print "Poor Alex"
因此,只能想別的思路。先去寫,通過了再上傳