๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm ๐Ÿง‘๐Ÿปโ€๐Ÿ’ป/๋ฐฑ์ค€(BOJ)

[๋ฐฑ์ค€,c++] 1026๋ฒˆ - ๋ณด๋ฌผ

by dkswnkk 2021. 10. 16.
 

1026๋ฒˆ: ๋ณด๋ฌผ

์ฒซ์งธ ์ค„์— N์ด ์ฃผ์–ด์ง„๋‹ค. ๋‘˜์งธ ์ค„์—๋Š” A์— ์žˆ๋Š” N๊ฐœ์˜ ์ˆ˜๊ฐ€ ์ˆœ์„œ๋Œ€๋กœ ์ฃผ์–ด์ง€๊ณ , ์…‹์งธ ์ค„์—๋Š” B์— ์žˆ๋Š” ์ˆ˜๊ฐ€ ์ˆœ์„œ๋Œ€๋กœ ์ฃผ์–ด์ง„๋‹ค. N์€ 50๋ณด๋‹ค ์ž‘๊ฑฐ๋‚˜ ๊ฐ™์€ ์ž์—ฐ์ˆ˜์ด๊ณ , A์™€ B์˜ ๊ฐ ์›์†Œ๋Š” 100๋ณด๋‹ค ์ž‘๊ฑฐ

www.acmicpc.net

// Copyright ยฉ 2021 ์•ˆ์ฃผํ˜•. All rights reserved.
//
// https://www.acmicpc.net/problem/1026
// BOJ1026 ๋ณด๋ฌผ
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
int ans = 0;
cin >> T;
vector<int>less(T);
vector<int>greate(T);
for (int i = 0; i < T; i++) {
cin >> less[i];
}
for (int i = 0; i < T; i++) {
cin >> greate[i];
}
sort(less.begin(), less.end()); //์˜ค๋ฆ„์ฐจ์ˆœ ์ •๋ ฌ
sort(greate.begin(), greate.end(), greater<int>()); //๋‚ด๋ฆผ์ฐจ์ˆœ ์ •๋ ฌ
for (int i = 0; i < T; i++) {
ans += less[i] * greate[i];
}
cout << ans<<"\n";
}

GitHub

LinkedIn

GitHub

LinkedIn