programming-challenges Weights and Measures (111103) 题解

不是一个dp的解法，但是复杂度只有o(n*n)

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <assert.h>
#include <algorithm>
#include <math.h>
#include <ctime>
#include <functional>
#include <string.h>
#include <stdio.h>
#include <numeric>
#include <float.h>

using namespace std;

struct Rec {
	int weight, strength;
	Rec(int w, int s) : weight(w), strength(s) {}
};

vector<Rec> trs; 

int main() {
	int w, s, n; 
	while (cin >> w) {
		cin >> s; 
		trs.push_back(Rec(w, s)); 
	}

	bool getOne = true; 
	int result = 0; 
	int left = 0x7fffffff;
	n = trs.size(); 

	vector<bool> visited(n); 
	while (getOne && left > 0) {
		getOne = false; 
		int capacity = -1, index = -1; 
		for (int i = 0; i < n; i++) {
			if (visited[i]) continue;
			if (left < trs[i].weight) continue;
			if (capacity < min(left, trs[i].strength) - trs[i].weight) {
				index = i; 
				capacity = min(left, trs[i].strength) - trs[i].weight;
			}
		}
		if (index >= 0) {
			getOne = true;
			result++; 
			visited[index] = true;
			left = capacity;
		}
	}

	cout << result << endl; 

	return 0; 
}