T1 class Solution { public: int minDifference(vector<int>& a) { int n=a.size(); long long ans=a[0]-a[1]; if(ans<0) ans=-ans; for(int i=0; i<n-1; ++i) for(int j=i+1; j<n; ++j) if(a[i]>a[j]) ans=min(ans, 1LL*a[i]-a[j]); else ans=min(ans, 1LL*a[j]-a[i]); return ans; } };