우사미 코딩

1. 문제링크 https://leetcode.com/problems/maximum-subsequence-score/ Maximum Subsequence Score - LeetCode Can you solve this real interview question? Maximum Subsequence Score - You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indic leetcode.com - nums1 : sum nums - nums2..

1. 오름차순 정렬 - sort (begin, end) vector v = { 4, 2, 3, 1, 5 }; sort(v.begin(), v.end()); // 오름차순 정렬 // 정렬 후 원소 출력 for(auto i : v){ cout