leetcode/AssignCookies.cpp at master · Yac836/leetcode · GitHub

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
#include <iostream>
#include <vector>
#include <vector>
#include <map>
#include <iterator>
#include <algorithm>
using namespace std;
int findContentChildren1(vector<int>& g, vector<int>& s) {
	sort(g.begin(), g.end());

	sort(s.begin(), s.end());
	auto leng = g.size();
	auto lens = s.size();
	int i = 0, j = 0;
	for (;i < leng && j < lens; j++)
		if (g[i] <= s[j])
			i++;
	return i;

}
int findContentChildren(vector<int>& g, vector<int>& s) {
	map<size_t, size_t> ssg;
	map<size_t, size_t> sss;
	for (const auto e : g)
		++ssg[e];
	for (const auto e : s)
		++sss[e];
	for (const auto e : ssg) {
		cout << e.first << " " << e.second << endl;;
	}
	cout << "------------------" << endl;
	for (const auto e : sss) {
		cout << e.first << " " << e.second << endl;;
	}
	cout << "------------------" << endl;
	int count = 0;
	auto bs = sss.begin();
	auto bg = ssg.begin();
	while (bg != ssg.end()){
		while(bs != sss.end()) {
			if (bs->first >= bg->first) {
				cout << bs->first << "   ";
				if (bs->second >= bg->second) {
					count = count + bg->second;
					bs->second = bs->second - bg->second;
					if (bs->second == 0) {
						bs++;

					}
					bg++;
					break;
				}
				else {
					count = count + bs->second;
					bg->second = bg->second - bs->second;
					bs++;
					continue;
				}
			}
			else {
				bs++;
			}
		}
		if (bs == sss.end())
			break;
	}
	return count;
}
int main() {
	/*vector<int> a{ 262, 437, 433, 102, 438, 346, 131, 160, 281, 34, 219, 373, 466, 275, 51, 118, 209, 32, 108, 57,
		385, 514, 439, 73, 271, 442, 366, 515, 284, 425, 491, 466, 322,
		34, 484, 231, 450, 355, 106, 279, 496, 312, 96, 461, 446, 422,
		143, 98, 444, 461, 142, 234, 416, 45, 271, 344, 446, 364, 216, 16,
		431, 370, 120, 463, 377, 106, 113, 406, 406, 481, 304, 41, 2, 174, 81,
		220, 158, 104, 119, 95, 479, 323, 145, 205, 218, 482, 345, 324, 253,
		368, 214, 379, 343, 375, 134, 145, 268, 56, 206 };
	vector<int> b{ 149, 79, 388, 251, 417, 82, 233, 377, 95, 309, 418, 400, 501, 349, 348, 400,
		461, 495, 104, 330, 155, 483, 334, 436, 512, 232, 511, 40, 343, 334,
		307, 56, 164, 276, 399, 337, 59, 440, 3, 458, 417, 291, 354, 419, 516, 4, 370, 106, 469, 254, 274, 163, 345, 513, 130, 292, 330, 198, 142, 95, 18, 295, 126, 131, 339, 171, 347, 199, 244, 428, 383, 43, 315, 353, 91, 289, 466, 178, 425, 112, 420, 85, 159, 360, 241, 300, 295, 285, 310, 76, 69, 297, 155, 416, 333, 416, 226, 262, 63, 445, 77, 151, 368, 406, 171, 13, 198, 30, 446, 142, 329, 245, 505, 238, 352, 113, 485, 296, 337, 507, 91, 437, 366, 511, 414, 46, 78, 399, 283, 106, 202, 494, 380, 479, 522, 479, 438, 21, 130, 293, 422, 440, 71, 321, 446, 358, 39, 447, 427, 6, 33, 429, 324, 76, 396, 444, 519, 159, 45, 403, 243, 251, 373, 251, 23, 140, 7, 356,
		194, 499, 276, 251, 311, 10, 147, 30, 276, 430, 151, 519,
		36, 354, 162, 451, 524, 312, 447, 77, 170, 428, 23, 283,
		249, 466, 39, 58, 424, 68, 481, 2, 173, 179, 382, 334, 430,
		84, 151, 293, 95, 522, 358, 505, 63, 524, 143, 119, 325, 401,
		6, 361, 284, 418, 169, 256, 221, 330, 23, 72, 185, 376, 515, 84,
		319, 27, 66, 497 };*/
	vector<int> a{ 10, 9, 8, 7 };
	vector<int> b{ 5, 6, 7, 8 };
	cout << findContentChildren1(a, b);
}