【正文】 ath date will be given. One or more white space characters will separate tokens on the input line. Note that if a president was inaugurated more than once, they may appear in the input more than once。而我們的主人公小Q，正想買一條漂亮的掛綴放在寢室里作為裝飾。每一個(gè)綴珠由三部分組成：分別是珠子、珠子上方的連接環(huán)與珠子下方的掛鉤（如下圖）。小Q 想買一根足夠長的掛綴，這樣顯得更有韻味?　　然而商店的老板告訴小Q，掛綴是不可能做到任意長的，因?yàn)槊恳粋€(gè)珠子都受到重力作用，對其上方的掛鉤有一定的拉力，而掛鉤的承受能力是有限的。一個(gè)掛綴是穩(wěn)定的，當(dāng)且僅當(dāng)對于其上的每一個(gè)珠綴，它下方所有珠綴的重量和（不包含自身）不超過其掛鉤的承受能力?！据斎胛募?第一行包含一個(gè)正整數(shù)N，表示商店擁有的珠綴數(shù)目。【輸出文件】 包行兩行。第二行包含一個(gè)整數(shù)W，表示可以找到的長度為L 的穩(wěn)定掛綴中的最小重量和。如果掛綴長度L 與答案一致，而最小重量和W 與答案不一致，該測試點(diǎn)則得4 分?！緮?shù)據(jù)規(guī)?！繉τ?0%的數(shù)據(jù)，N ≤ 10000；對于100%的數(shù)據(jù)，N ≤ 200000；對于所有的數(shù)據(jù)，Wi, Ci 不超過231。di , i = 1, N , that specify the profit 0≤pi≤10000 and the deadline 0≤di≤10000 of the application i.Input data are separated by white spaces, are correct, and terminate with an end of file.OutputFor each data set the program putes the maximum profit the Bank can get from the accepted mortgage applications corresponding to that data set. The result is printed on standard output from the beginning of a line. There must be no empty lines on output. An example of input/output is shown below.Sample Input4 1 4 2 1 0 2 0 3 17 2200 1 200 1 100 0 1000 2 80 150 20 500 10 1001 0 4 1000Sample Output920 5000()ACM/ICPC Regional Warmup Contest 2002 Problem En sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is installed at the horizontal center line of the strip. For each sprinkler we are given its position as the distance from the left end of the center line and its radius of operation.What is the minimum number of sprinklers to turn on in order to water the entire strip of grass?InputInput consists of a number of cases. The first line for each case contains integer numbers n, l and w with n = 10000. The next n lines contain two integers giving the position of a sprinkler and its radius of operation. (The picture above illustrates the first case from the sample input.)OutputFor each test case output the minimum number of sprinklers needed to water the entire strip of grass. If it is impossible to water the entire strip output 1.Sample input8 20 25 34 11 27 210 213 316 219 43 10 13 59 36 13 10 15 31 19 1Sample Output621(例題4)Europe – Northeastern Europe 2004 Problem JJoke with TurtlesThere is a famous jokeriddle for children:Three turtles are crawling along a road. One turtle says: “There are two turtles ahead of me.” The other turtle says: “There are two turtles behind me.” The third turtle says: “There are two turtles ahead of me and two turtles behind me.” How could this have happened? The answer is the third turtle is lying!Now in this problem you have n turtles crawling along a road. Some of them are crawling in a group, so that they do not see members of their group neither ahead nor behind them. Each turtle makes a statement of the form: “There are ai turtles crawling ahead of me and bi turtles crawling behind me.” Your task is to find the minimal number of turtles that must be lying. Let us formalize this task. Turtle i has xi coordinate. Some turtles may have the same coordinate. Turtle i tells the truth if and only if ai is the number of turtles such that xj xi and bi is the number of turtles such that xj xi. Otherwise, turtle i is lying.InputThe input contains several test cases. The first line of each case consists of a integer number n ( 1≤n≤1000). It is followed by n lines containing numbers ai and bi ( 0≤ai, bi≤1000) that describe statements of each turtle for i from 1 to n.OutputFor each input case, print one output line containing an integer number m the minimal number of turtles that must be lying, followed by m integers turtles that are lying. Turtles can be printed in any order. If there are different sets of m lying turtles, then print any of them.Sample Input32 00 22 250 20 32 11 24 0Sample Output1 32 1 4 ()USACO 2005 dec silverCleaning Shifts [Coaches, 2004]Farmer John39。 he may NOT ask a cow to work only a fraction of the time it indicated and receive a corresponding fraction of the salary.Find a schedule in which every second of the workday is covered by at least one cow and which minimizes the total salary that goes to the cows.TIME LIMIT: secondsPROBLEM NAME: cleanINPUT FORMAT:Line 1: Three spaceseparated integers: N, M, and E.Lines 2..N+1: Line i+1 describes cow i39。 n is the number of groups and m is the number of trips. The groups are numbered from 1 to n, and the trips are numbered from 1 to m.The following n lines contain group sizes, one per line. Line i+1 contains integer si the size of the ith group, 1=s=109. The following m lines contain trip descriptions, one trip per line. Line n+j+1 contains two integers: lj and uj, separated by single space. lj is the minimum, and uj is the maximum size of a group for which the trip can be arranged (1=lj=uj=109)Output fileThe first line of output file should contain one integer k=0 the maximum number of trips that can be arranged. The following k lines should contain the description of the matching. Each of these lines should contain a pair of integers separated by single space: the number of a group and the number of a trip. There can be many answers and your program may print anyone of them.Example5 4546942156 620 502 87 2032 13 44 2()CEOI 2000 Enlightened LandscapeEnlightened landscapeConsider a landscape posed of connected line segments:Above the landscape, N light bulbs are hang at the same height T in various horizontal positions. The purpose of these light bulbs is to light up the entire landscape. A landscape point is considered lit if it can see a light bulb directly, that is, if the line segment which links the point with a bulb does not contain any other landscape segments