You are layout editor for Town & Style Magazine, a "luxury lifestyle magazine serving the St. Louis metropolitan area." You are given a collection of n news articles a1 . . . an, such that article ai occupies `i column inches. After laying out all the ads for the paper, you are left with n slots s1 . . . sn, such that sj can hold a news article of up to mj column inches. Any article can be run in any slot. However, if an article is too long for its slot, some text must be cut to make it fit; if the article is too short, you must paste in some random content from Wikipedia to make it long enough to fill the whole slot. Neither change is desirable; it is best to run an article in a slot that is the right size for it. Give an O(n log n)-time algorithm to assign articles to slots so as to minimize the total change required for all articles. If ai is assigned to sj , the change required for ai is |`i − mj |.