1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool sort_desc (long i,long j) { return (i>j); }

bool AllItemsWerePacked(const long *items, int itemsNumber)
{
	int indexItems = 0;

	for (indexItems = 0; indexItems < itemsNumber; ++indexItems)
	{
		if (items[indexItems] != 0)
		{
			break;
		}
	}

	return indexItems == itemsNumber;
}

void PrepareTemporaryItems(long *items, long *tempItems, int itemsNumber)
{
	for (int index = 0; index < itemsNumber; ++index)
	{
		tempItems[index] = items[index];
	}
}

int CalculateNumberOfPacks(long *items, int itemsNumber,
						   long *packs, int packsNumber, int currentIndex)
{
	int indexPacks = 0;
	int indexItems = 0;
	int packsCount = 0;

	for (indexPacks = 0; indexPacks < packsNumber; ++indexPacks)
	{
		long packSize = packs[indexPacks];
		bool firstItem = true;

		packsCount++;

		for (indexItems = currentIndex; indexItems < itemsNumber; ++indexItems)
		{
			long itemWeight = items[indexItems];	

			if (itemWeight == 0)
			{
				continue;
			}

			if (itemWeight > packSize)
			{
				if (firstItem)
				{
					packsCount = -1;
					break;
				}

				if (packSize == 0)
				{
					break;
				}
			}
			else
			{
				packSize -= itemWeight;
				items[indexItems] = 0;

				if (firstItem)
				{
					currentIndex = 0;
					firstItem = false;
				}
			}
		}

		if (packsCount == -1 || AllItemsWerePacked(items, itemsNumber))
		{
			break;
		}
	}

	if (packsCount > 0 && !AllItemsWerePacked(items, itemsNumber))
	{
		packsCount = -1;
	}

	return packsCount;
}

int main()
{
	int itemsNumber;
	int packsNumber;

	cin >> itemsNumber >> packsNumber;

	long *items = new long[itemsNumber];
	long *packs = new long[packsNumber];

	int index = 0;
    while (index < itemsNumber)
    {
        cin >> items[index];
        index++;
    }

	index = 0;
    while (index < packsNumber)
    {
        cin >> packs[index];
        index++;
    }

	sort(items, items + itemsNumber, sort_desc);
	sort(packs, packs + packsNumber, sort_desc);

	long *tempItems = new long[itemsNumber];
	int packsCount = 0;
	int packsCountBestResult = -1;

	for (int index = 0; index < itemsNumber; ++index)
	{
		PrepareTemporaryItems(items, tempItems, itemsNumber);

		packsCount = CalculateNumberOfPacks(tempItems, itemsNumber, packs, packsNumber, index);

		if (packsCountBestResult == -1 || packsCount > 0 && packsCount < packsCountBestResult)
		{
			packsCountBestResult = packsCount;
		}
	}

	if (packsCountBestResult == -1)
	{
		cout << "NIE";
	}
	else
	{
		cout << packsCountBestResult;
	}

	delete [] items;
	delete [] packs;
	delete [] tempItems;

	return 0;
}