Description: acm algorithm design with n pieces of work assigned to the n individuals. I will be allocated to the work of the first j for the cost of personal Cij. Try to design an algorithm for each individual a different allocation of effort and minimize the total cost. To design an algorithm for a given cost of the work to calculate the best distribution of work to minimize the total cost. Input: the first line there is a positive integer n (1 ≤ n ≤ 30). N the next line, n the number of each line, the cost of that work. Output: the minimum total cost. Cases of type: 31,023,234,345 cases output: 9
To Search:
File list (Check if you may need any files):
Work Assignment
...............\Debug
...............\.....\StdAfx.obj
...............\.....\vc60.idb
...............\.....\vc60.pdb
...............\.....\Work Assignment.exe
...............\.....\Work Assignment.ilk
...............\.....\Work Assignment.obj
...............\.....\Work Assignment.pch
...............\.....\Work Assignment.pdb
...............\ReadMe.txt
...............\StdAfx.cpp
...............\StdAfx.h
...............\Work Assignment.cpp
...............\Work Assignment.dsp
...............\Work Assignment.dsw
...............\Work Assignment.ncb
...............\Work Assignment.opt
...............\Work Assignment.plg
Download