OJ Board

Thank you.

Your algorithm is the same as mine----1)Sort the boxes' dimensions 2)Get the longest path.And My solution was accepted two days ago.
Goodluck.

I still don't know why I got WA.
Here are some of my test data.

1 2 3 4 5 6 7 8 9
1000 200 1500 350 5000 1000 1000 2000 13000
5 10 5 20 10 5 10 20 10
60 20 1000 1000 60 20 10000 20 500
20 1000 50 2000 50 500 1500 20 3000
20 1000 50 2000 50 5000 1500 20 300

And My output.
BCG 30
BGC 6050
CBG 50
CGB ...

Can someone tell me what is wrong with the program.If there are two posibilities I do print the one which is earlier in alphabetical order.
Thank you.

#include<stdio.h>
#include<iostream.h>
long r1,r2,r3;
long bin[4][4];
long total;
char mark[5]=" BCG";

long count(long r1,long r2,long r3 ...