| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 11743 | The Great Depression |
|
| 11744 | The Monkey |
|
| 11745 | Add two Linked List |
|
Description
Writer: jjjjj19980806 Description: pclightyear Difficulty: ★★★☆☆
As you all know, Kim Jong-un is the Chairman of the Workers' Party of Korea and supreme leader of North Korea. Over the past two years, the automobile industry in North Korea has been suffering from severe depression. The supreme leader thus decides to reorganize the whole industry to make North Korea GREAT AGAIN.
According to the survey, there are n factory in North Korea. Each of them can produce two kinds of cars (car A & car B). Now, the supreme leader wants to assign x factory to produce car A and y factory to produce car B (i.e. no factory will produce two kinds of car at the same time.) so that the net profit will become maximum.
Although the supreme leader is absolutely smart enough to write a program by himself, he doesn't want to waste time on this little tiny thing. The supreme leader will thus give you the net profit each factory can make by producing car A and car B. Your program need to distribute x factory to produce car A and list their name in lexicographical order.
DO NOT DISAPPOINT HIM!!
Input
The first line contains three integers n, x, y, representing the total number of factory, the number of factory planned to produce car A, and the number of factory planned to produce car B. (according to the supreme leader's demand)
The next n lines contains one string si and two integers ai, bi, representing the name of each factory, and the net profit each factory can make by producing only car A or only car B.
It is guaranteed that :
- 0 < n, x, y < 105
- x + y = n
- 1 ≤ | si | ≤ 20
- 0 < ai, bi < 109
- No duplicate names appears.
- The answer will be unique.
Output
Please output the list of x factory that need to produce car A in lexicographical order so that it will maximum the net profit.
Sample Input Download
Sample Output Download
Tags
Discuss
Description
Writer: jjjjj19980806 Description: pclightyear Difficulty: ★★★☆☆
The infinite monkey theorem is one of the famous thought experiment that describe the concept of infinite and probabilities. pclightyear is curious about the correctness of this theorem. He keeps a monkey, named Evan, as a pet so that he can really implement this experiment in his dormitory.
You are hired as the assistant of pclightyear. During the experiment, you will record a sequence of characters representing the keys Evan punches (pclightyear is caring about the polar bears, so he didn’t want to waste any paper or electricity.). After the experiment, it is your job to restore the origin sentence Evan types.
The sequence you records follows the following rules:
1. Character ‘>’ represents that Evan right shifts the cursor. If the cursor is located at the back of the sentence, it does nothing.
2. Character ‘<’ represents that Evan left shifts the cursor. If the cursor is located at the front of the sentence, it does nothing.
3. The capital letter ‘D’ represents that Evan deletes a character. If there is no character after the cursor, it does nothing.
4. The lowercase letter from ‘a’ to ‘z’ represents that Evan types a lowercase character (same as your record).
5. The underline symbol ‘_' represents that Evan types ‘_’.
After Evan types a character, the cursor will locate at the back of the character Evan just type.
Attention:
Memory Limit Exceeded works properly now, the judge will assign the basic memory limit plus additional 8MB for every test case.
Assume a 32MB memory limit, there will be two conditions:
a. The submission use more than 32MB and less than 40MB.
In this case, the submission will get a Memory Limit Exceeded verdict.
b. The submission use more than 40MB.
In this case, the submission will get a Runtime Error verdict.
Input
There is only a single line contains many characters, representing your record after the experiment.
It is guaranteed that:
- Your record won't exceed 107 characters.
- At any time, the sentence Evan types won't exceed 2 × 105 characters.
Output
Please output a line representing the sentence Evan types during the experiment.
NOTICE the memory limit at test case #4.
Sample Input Download
Sample Output Download
Tags
Discuss
Description
Writer: jjjjj19980806 Description: pclightyear Difficulty: ★☆☆☆☆
In this problem, you have to implement 4 functions to add two linked list together.
1. void Create_List(Node**, int);
This function is used to create the linked list according to the input.
2. Node* Add_List(Node*, Node*);
This function is used to create a linked list by adding two linked lists together.
3. void Print_List(Node*);
This function is used to print out the key value in the linked list.
4. void Free_List(Node*);
This function is used to free the memory space.
Input
The input contains two lines of several integers, each line represents a linked list, and each integer represents a node in the linked list.
Each line of input is ended by -1, and you don't need to add a new node with key value -1.
It is guaranteed that:
- Each key value in the node is an integer between 0 and 100.
- Each linked list has less than 10 nodes.
Output
You need to output the two original linked lists and the linked list after you add the two original linked lists.
Each key value is separated by "->".