c Newbie, ask for help! c Urgent Question!!

#include

using namespace std;

class money

int yuan,jiao;

public:

money(int yuan=0,int jiao=0)yuan=yuan;

jiao=jiao;

money(double d)

yuan=int(d);

jiao=int((d-yuan)*10);

money& operator++(

money operator++(int);

money& operator--(

money operator--(int);

void show(char*s)

cout<10)

yuan+=1;

jiao-=10;

return *this;

money money::operator++(int)money temp=*this;

jiao++;

if(jiao>10)

yuan+=1;

jiao-=10;

return temp;

money& money::operator--(if(jiao ==0)

yuan -=1;

jiao =10;

jiao--;

return *this;

money money::operator--(int)money temp=*this;

if(jiao ==0)

yuan -=1;

jiao =10;

jiao --

return temp;

Here you have an example, I think you have to figure out 2 questions.

1.Function overloading.

2.The reason why the value returned by the pre++ is different from the post++.

You declare yes inside the class.

money operator++(

The implementation is. money &money::operator++ returns a different type, so there was an error.

The function is the same as above.

To give an idea, first of all, make it clear that for a certain number, you can either choose to move the number to the head of the queue or not move it, and each number can only move at most once. A number that needs to be moved can only be preceded by that numberThere are numbers that are greater than him, or there may be numbers that are larger than him. If there is a number that is larger than him in front of this number, then the movement is definitely necessary, and if there is no number larger than him in front of this number, but there is a number larger than him that will move, then the movement is still necessary.

The first case is easy to judge, and in the second case, it is enough to determine whether all the numbers that are larger than this number are arranged from small to large.

There are several important points in this question:

1. It can be read in a loop until 0 is entered.

2. Keep integers greater than 0 and divisible by 4. This one is also easy to deal with.

3. Sort from small to large, this is no problem. There are a whole bunch of sorting algorithms that can be found online.

4. There are 800 million input data. This is very crucial. Because memory can't allocate 800 million integers all at once, waiting to be put in data.

This one has to be broken into chunks. For example, apply for an array of 1024 * 1024 integers to store the filtered data. When the mold is full, sort it.

Then write to the disk file. Then use this array again, and after it is full again, the sharp age sorts the silver in the open, and writes it to the file.

5. Finally, use merge and sort to read the data out of the file piece by piece. After sorting, output to the screen.