PAT 数据结构 2-09 装箱问题模拟

http://pat.zju.edu.cn/contests/ds/2-09

import java.util.*;

class Main
{
public static void main(String[] args)
{
int n;
int[] reserve = new int[1010];
int[] index = new int[1010];
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int data[] = new int [1010];
for(int i=1;i<=n;i++)
{
reserve[i] = 100;
}
int bagIndex=1;
for(int i =1;i<=n;i++)
{
data[i] = sc.nextInt();
boolean flag = false;
for(int j =1;j<=bagIndex;j++)
{
if(data[i]<=reserve[j])
{
flag = true;
index[i] = j;
reserve[j] = reserve[j] - data[i];
break;
}
}
if(!flag)//can't find apporiate Bag
{
bagIndex++;
reserve[bagIndex] = reserve[bagIndex] - data[i];
index[i] = bagIndex;
}
}

for(int i =1;i <= n;i++)
{
System.out.println(data[i]+" "+index[i]);
}
System.out.println(bagIndex);

}
}