1339 ๋จ์ด ์ํ
์๊ณ ๋ฆฌ์ฆ(๋ธ๋ฃจํธํฌ์ค, ๊ทธ๋ฆฌ๋)
- ๋ธ๋ฃจํธํฌ์ค
1. ์ด๋ค ์ํ๋ฒณ์ด ๋์๋์ง ๊ธฐ๋กํ๊ณ , ๊ฑฐ๊ธฐ์ ๋ง์ถฐ ์ํ๋ฒณ์ ์ข
๋ฅ์ ๊ฐ์๋งํผ ๋ชจ๋ ๊ฐ๋ฅํ ์๋ฅผ ๋ฝ์ ๊ฒ์ฌํ๋ค.
- ๊ทธ๋ฆฌ๋
1. ๋ค์ด์ค๋ ๋จ์ด๋ฅผ ์ํ๋ฒณ ๋จ์๋ก ๋ถ๋ฅํ๊ณ ๋ค์์ฒ๋ผ ์๋ฆฟ์๋ฅผ ๊ณฑํด์ค๋ค.
ABC -> 100A + 10B + C
BCA -> 100B + 10C + A
2. ๊ทธ๋ฆฌ๊ณ ๋ชจ๋ ๋จ์ด๋ฅผ ๋ํด์ค๋ค.
101A + 110B + 11C
3. ์ด๋ฅผ ์์ ์๋ฆฟ์๋๋ก ๋ด๋ฆผ์ฐจ์ ์ ๋ ฌํ๋ฉด, ๊ฐ์ฅ ์ปค์ผํ ์๊ฐ ๋์ค๊ณ , ๊ทธ์๋ฐ๋ผ ์๋ฅผ ๋ถ์ฌํ๊ณ ๊ณ์ฐํ๋ฉด ๋๋ค.
110B + 101A + 11C
์ฝ๋
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int N, acheck[26], index, result;
string word;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> word;
int digit = 1;
for (int j = word.size() - 1; j >= 0; j--) {
if (acheck[word[j] - 'A'] == 0)
index++;
acheck[word[j] - 'A'] += digit;
digit *= 10;
}
}
sort(acheck, acheck + 26);
int cur = 9 - index + 1;
for (int i = 26 - index; i < 26; i++) {
result += acheck[i] * cur;
cur++;
}
cout << result;
}