发放贷款

#include <cstdio>
#include <limits.h>
#include <vector>
#include <functional>
#include <string>
#include <iostream>

using namespace std;

int main()
{
 //freopen("in.txt", "r", stdin);
 int m, n;
 string name;
 int loans;
 while (scanf("%d%d", &m, &n) != EOF)
 {
  vector<pair<string, int>> people;
  people.reserve(m);
  for (int i = 0; i < m; ++i)
  {
   cin >> name >> loans;
   people.emplace_back(name, loans);
  }
  vector<bool> has_money(m, false);
  vector<string> order;
  order.reserve(m);
  int leftLoans;
  while (order.size() < m)
  {
   leftLoans = n;
   for (int i = 0; i < m; ++i)
   {
    if (has_money[i] || people[i].second > leftLoans) continue;
    order.emplace_back(people[i].first);
    leftLoans -= people[i].second;
    has_money[i] = true;
   }
  }

  for (auto& s : order) printf("%s\n", s.c_str());
  printf("\n");
 }

 return 0;
}

import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int m = sc.nextInt();
			int n = sc.nextInt();
			People[] p = new People[m];
			for (int i = 0; i < m; i ++ ) {
				p[i] = new People(sc.next(), sc.nextInt(), false);
			}
			int count = 0;
			int money = n;
			while (count < m) {
				for (int i = 0; i < m; i ++ ) {
					if( ! p[i].flag && p[i].need <= money) {
						money -= p[i].need;
						p[i].flag = true;
						count ++ ;
						System.out.println(p[i].name);
					}
				}
				money = n;
			}
			System.out.println();
		}
	}
	static class People {
		String name;
		int need;
		boolean flag;
		public People(String name, int need, boolean flag) {
			this.name = name;
			this.need = need;
			this.flag = flag;
		}
	}
}

import sys

m, n = 0, 0
start = 0  # 记录每组开始的索引
names = []
amounts = []
for i, line in enumerate(sys.stdin):
    a = line.split(" ")
    if i == start:
        m = int(a[0])
        n = int(a[1])
        start = i + m + 1
    else:
        names.append(a[0])
        amounts.append(int(a[1]))
        if i == start - 1:
            cur_money = n
            is_process = [False] * len(names) 
            processed_names = []
            count = 0 # 记录处理的人数
            while count < m:
                for i in range(len(names)):
                    if amounts[i] <= cur_money and not is_process[i]:
                        cur_money -= amounts[i]
                        processed_names.append(names[i])
                        is_process[i] = True
                        count += 1
                        if cur_money == 0:
                            break
                cur_money = n
            names = []
            amounts = []

            for name in processed_names:
                print(name)
            print()

#include <iostream>
#include<vector>
#include<string>
using namespace std;
typedef pair<string, int> PAIR;

int main()
{		
	int length, num;
	while (cin >> length >> num)
	{
		vector<PAIR> data;
		vector<string> res;
		PAIR p;
		for (int i = 0; i < length; i++)
		{
			cin >> p.first >> p.second;
			data.push_back(p);
		}
		int cnt = 0, sum;		
		while (cnt != length)
		{
			sum = num;
			for (vector<PAIR>::iterator it = data.begin(); it != data.end();it++)
			{
				if (it->second != 0 && it->second <= sum)
				{
					res.push_back(it->first);
					sum -= it->second;
					it->second = 0;
					cnt++;
				}
			}
		}
		for (vector<string>::iterator k = res.begin(); k != res.end(); k++)
			cout << *k << endl;
		cout << endl;
	}
	return 0;
}

#include <iostream>
#include <string>
#include <queue>
using namespace std;

void application(queue<pair<string, int> > que[2], int n)
{
	int swh = 0, total = n;  // swh是两个队列切换的标记。 while (!que[swh].empty() || !que[!swh].empty())
	{
		total = n;
		while (!que[swh].empty())
		{
			if (total >= que[swh].front().second)
			{
				total -= que[swh].front().second;
				cout << que[swh].front().first << endl;
			}
			else que[!swh].push(que[swh].front());
			que[swh].pop();
		}
		swh = !swh;
	}
}


int main()
{
	int m, n;
	while (cin >> m >> n && (m || n))
	{
		queue<pair<string, int> > que[2];
		string name;
		int apply;
		for (int i = 0; i < m; ++i)
		{
			cin >> name >> apply;
			que[0].push(pair<string, int>(name, apply));
		}
		
		application(que, n);
		
		cout << endl;
	}
	return 0;
}