Submission

Status:

--------PP

Subtask/Task Score:

20/100

Score: 20

User: Sun999

Problemset: สูงต่ำในตาราง

Language: cpp

Time: 0.002 second

Submitted On: 2026-09-22 10:38:21

#include <iostream>
using namespace std;
int main(){
	int N,B;
	int row=1;
	cin>>N>>B;
	int arr[N*N];
			for(int i=0; i<N*N;i++){
				cin>>arr[i];	
		}						
			for(int i=0; i<N; i++){
			arr[i] = arr[i]+B;
		}
			for(int i=0; i<N*N; i++){
				if(i>N*(N-1) && i<N*N){				
					arr[i] = arr[i]-B;	
			}
		}
	int oldmax=arr[0];
	int oldmin=arr[0];
		for(int i=0; i<N*N; i++){
			if (arr[i] > oldmax){
				oldmax = arr[i];
			}
			if (arr[i] < oldmin){
				oldmin = arr[i];
			}		
		}

		int dif = oldmax-oldmin;
		
cout<<dif<<"\n";

	return 0;
}