sort(a, a + N); (a[0] ~ a[N-1])
sort(a + l, a + r); (a[l+1] ~ a[r-1])
sort(a, a + N, greater< int >()); (大きい順)
計算量は O(NlogN)
string 型のソートでは、辞書式順序で早い方が小さいとみなされる
More than 1 year has passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme