您的答案為: 0 0 正確答案為: 1 36
#include <iostream> using namespace std; int main() { int a,b,count=0,cost=0; cin >> a >> b; int thing[a][3]; for (int i=0;i<a;i++){ cin >> thing[i][0] >> thing[i][1] >> thing[i][2] ; } for (int j=0;j<a;j++){ for (int l=0;l<a;l++){ for (int i=0;i<2;i++){ if (thing[j][i] >= thing[j][i+1]){ int t = thing[j][i]; thing[j][i] = thing[j][i+1]; thing[j][i+1] = t; } } } } for (int i=0;i<a;i++){ if ((thing[i][2] - thing[i][0]) >= b){ count ++; cost=cost + ((thing[i][0] + thing[i][1] + thing[i][2])/3); } } cout << count << " " << cost ; }
#5: 5% WA (line:1)
您的答案為: 0 0 正確答案為: 1 36
#include using namespace std; int main() { int a,b,count=0,cost=0; cin >> a >> b; int thing[a][3]; for (int i=0;i> thing[i][0] >> thing[i][1] >> thing[i][2] ; } for (int j=0;j= thing[j][i+1]){ int t = thing[j][i]; thing[j][i] = thing[j][i+1]; thing[j][i+1] = t; } } } } for (int i=0;i= b){ count ++; cost=cost + ((thing[i][0] + thing[i][1] + thing[i][2])/3); } } cout << count << " " << cost ; }
試試看這組測資
1 4
6 8 4
答案應為1 6而非0 0
問題就在排序thing [j]沒有完全排好
要完全排好,改成l<=a