[정렬] 3월 7일

03월_04일-정렬/1026.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+// 테스트 결과는 똑같이 나왔으나 백준에선 틀렸다고 나옴
+
+void minS(vector<int> &a, vector<int> &b, int n)
+{
+    //가장 작은 값과 가장 큰 값을 곱하면 최솟값이 나오지 않을까?
+    //그 다음 작은 값과 그 다음 큰 값을 만나도록 짜려면?
+    // a를 오름차순으로 정렬한 뒤 b의 가장 큰 값의 인덱스를 찾아 a의 첫 번째 원소부터 짝을 맺게 하면 되지 않을까?
+    vector<int> tmp1 = a;
+    vector<int> tmp2 = b;
+    sort(tmp1.begin(), tmp1.end());
+
+    int max_a = 0, max_b = 0, max_index = 0, min_index = 0;
+    int min_a = a[0], min_b = b[0];
+
+    for (int i = 0; i < n; i++) // a 원소를 순서대로 바꿈
+    {
+        for (int j = 0; j < n; j++) 
+        {
+            if (max_b < tmp2[j])
+            {
+                max_b = tmp2[j];
+                max_index = j;
+            }
+        }
+
+        a[max_index] = tmp1[i];
+
+        tmp2[max_index] = 0;
+        max_b = 0;
+    }
+
+    //합 구하기
+    int sum = 0;
+    for (int i = 0; i < n; i++)
+    {
+        sum += a[i] * b[i];
+    }
+
+    cout << sum;
+}
+
+int main()
+{
+    //입력
+    int n;
+    cin >> n;
+
+    vector<int> a(n);
+    vector<int> b(n);
+
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+    }
+    for (int i = 0; i < n; i++)
+    {
+        cin >> b[i];
+    }
+
+    //연산
+    minS(a, b, n);
+}

03월_04일-정렬/10804.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<int> card;
+
+
+void reverse(int a, int b)
+{
+    while (a < b)
+    {
+        swap(card[a++], card[b--]);
+    }
+}
+
+int main()
+{
+    vector<int> a(10, 0);
+    vector<int> b(10, 0);
+
+    card.assign(20, 0);
+
+    for (int i = 0; i<10 ; i++) {
+        cin >> a[i] >> b[i];
+    }
+
+    for (int i = 0; i < 20; i++)
+    {
+        card[i] = i + 1;
+    }
+
+    for (int i = 0; i<10 ; i++) {
+        reverse(a[i] - 1, b[i] - 1);
+    }
+
+    for (int i = 0; i < 20; i++)
+    {
+        cout << card[i] << " ";
+    }
+}

03월_04일-정렬/11651.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+struct coor
+{
+    int x, y;
+};
+
+bool cmp(const coor &a, const coor &b){
+    if (a.y == b.y) {
+        return a.x < b.y;
+    }
+    return a.y < b.y;
+}
+
+
+int main()
+{
+    int n;
+    cin >> n;
+    vector<coor> crd(n);
+
+    for (int i = 0; i < n; i++)
+    {
+        cin >> crd[i].x >> crd[i].y;
+    }
+
+    //연산
+    sort(crd.begin(), crd.end(), cmp);
+
+    //출력
+    for (int i = 0; i < n; i++)
+    {
+        cout << crd[i].x <<" "<< crd[i].y << "\n";
+    }
+}

03월_04일-정렬/12840.cpp

@@ -0,0 +1,49 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+void query(int T, int c, int &total)
+{
+    if (T == 1)
+    {
+        total = total + c;
+    }
+    else if (T == 2)
+    {
+        total = total - c;
+    }
+    else
+    {
+        int h_ = total / 3600;
+        int m_ = total % 3600 / 60;
+        int s_ = total % 3600 % 60;
+        cout << h_ << " " << m_ << " " << s_ << "\n";
+    }
+}
+
+int main()
+{
+    //현재 시간
+    int h, m, s, total;
+    cin >> h >> m >> s;
+
+    total = h * 3600 + m * 60 + s;
+
+    //쿼리 개수
+    int q;
+    cin >> q;
+
+    //쿼리
+    int T, c;
+    for (int i = 0; i < q; i++)
+    {
+        cin >> T;
+        if (T != 3)
+        {
+            cin >> c;
+            query(T, c, total);
+        }
+        query(T, 0, total);
+    }
+}

03월_04일-정렬/1758.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int maxTip(int n, vector<int> &tip)
+{
+    int t;
+    int max = 0;
+    for (int i = 0; i < n; i++)
+    {
+        t = tip[i] - i;
+        if (t < 0)
+        {
+            t = 0;
+        }
+
+        max += t;
+    }
+    return max;
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+
+    vector<int> tip(n, 0);
+    for (int i = 0; i < n; i++)
+    {
+        cin >> tip[i];
+    }
+
+    //연산
+    sort(tip.begin(), tip.end(), greater<>());
+    cout << maxTip(n, tip);
+}