WA in LOPOV

[mostafa_sof]

[[ NOTE: This post is not useful because of lots of deletions done for it ]]
here is the problem linkhttp://www.spoj.com/problems/LOPOV/
I've solved it ***** :

1- ***
2- ***
3- *** :
****;

that was my algorithm now here is my code

#include <iostream>
#include <*>
#include <*>
using namespace std;
int main()
{
   //code removed .
    return 0;
}

I don't know why it's giving WA , please tell me my fault or provide any useful test case , thanks in advance

[leppyr64]

Spoiler.

This is not correct.

[mostafa_sof]

This is not correct.

Thank you for replying ,please allow me to continue the argument :
the solution is based on the statement :
The best possible value ******.
the reason of taking ***** .

now we can modify the statement :
The best possible ****
*****.

Thanks you very much for your precious time .

[leppyr64]

You are correct.

Where in the problem statement does it say that the bags are all unique?

[mostafa_sof]

Thank you very much , I've added 5 letters to get AC
shall I remove the code and the explanation of the algorithm ?

I really appreciate your help , thank you again , and sorry to waste your time .

best regards

[leppyr64]

Yes. Please edit and remove it. And sorry for getting it wrong in the first place

[mostafa_sof]

No problem , It is always better to me to review my thinking .
I've removed the code , but the whole post is full of explanations of the algorithm, what should I do with them ?

[leppyr64]

Remove them too

[mostafa_sof]

Ok , done , but still your first reply there is a quote contains a spoiler [if you want to delete it too].