Comments

• 
  

  0

  

  NamKhanh187  commented on Feb. 14, 2025, 6:06 a.m.

  include <bits/stdc++.h>

  using namespace std; int arr[1001]; int main() { iosbase::syncwith_stdio(false); cin.tie(NULL); int n; cin >> n; int mx = 1e9 + 1; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr,arr+n); for (int i = 1; i < n; i++) { mx = min(mx, abs(arr[i] - arr[i - 1])); } cout << mx; return 0; }

• 
  

  -2

  

  an_du  commented on Nov. 10, 2024, 4:18 p.m.

  int main(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n); int min=a[1]-a[0]; for(int i=0;i<n-1;i++){ if((a[i+1]-a[i])<min){ min=a[i+1]-a[i]; } } cout<<min; return 0; }

• 
  

  -3

  

  duc_thinh_753  commented on Aug. 9, 2024, 1:49 p.m.

  import math

  if name == 'main': n = int(input()) a = list(map(int, input().split())) min_val = 10 ** 6 a.sort(reverse=True)

  for i in range(n):
      for j in range(i + 1, n):
          min = a[i] - a[j]
          if min < min_val:
              min_val = min
  print(min_val)
  

• 
  

  -3

  

  minhquan2905  commented on July 26, 2024, 8:52 a.m.

  int n; cin >> n; multiset<int> ms; for(int i=0;i<n;i++){ int x; cin >> x; ms.insert(x); } int min = 1e9; for(auto it = ms.begin();it!=ms.end();it++){ if(next(it) != ms.end()){ min = fmin(min, *next(it) - *it); } else{ break; } } cout << min;