JAVA 外卖店优先级 纯数组解法

	import java.util.*;
	import java.math.*;
	
	public class Main {		
		public static void main(String[]args) {
			Scanner in = new Scanner(System.in);
			int n = in.nextInt() , m = in.nextInt(), t = in.nextInt();
			int[] servers = new int[n + 1];
			int[] ts = new int[m];
			int[] id = new int[m];
			int[] prior = new int[n + 1];
			int ans = 0;
			for(int i = 0 ; i < m ; ++ i) {
//				第i个订单的时刻和外卖店id
				ts[i] = in.nextInt();
				id[i] = in.nextInt();
			}
			
			for(int i = 1 ; i <= t ; ++ i) {//遍历每一时刻
				int[] hasNot = new int[n + 1];//本时刻第n家店是否有订单
				for(int j = 0 ;  j < m ; ++ j) {//遍历所有订单
					if(i == ts[j])//第j个订单在i时刻的话
					{
						servers[id[j]] += 2;//第j个订单的店家 的优先级+2
						hasNot[id[j]] = 1;//第j个订单的店家在此时刻有订单
					}
				}
				for(int j = 1 ; j <= n ; ++ j) {
					if(hasNot[j] == 0) {//如果此时刻没订单优先级--
						if(servers[j] > 0)servers[j] --;
					}
//					判断是否进入优先级队列
					if(servers[j] > 5)prior[j] = 1;
					else if(servers[j] <= 3)prior[j] = 0;
				}
			}
			for(int i = 1 ; i <= n ; ++ i) {
				if(prior[i] == 1)ans++;
			}
			System.out.print(ans);
		}
	}