https://www.acmicpc.net/problem/1940
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, num_sum, count = 0;
cin >> N >> num_sum;
vector<int> arr(N, 0);
for (int i = 0; i < N; ++i) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
int start = 0, end = N - 1;
while (end > start) {
int sum = arr[start] + arr[end];
if (sum > num_sum) {
end--;
}
else if (sum < num_sum) {
start++;
}
else {
count++;
start++;
end--;
}
}
cout << count;
return 0;
}
'백준' 카테고리의 다른 글
11003번 (platinum 5) (0) | 2025.01.13 |
---|---|
1253번 (gold 4) (0) | 2025.01.12 |
2018번 (silver5) (0) | 2025.01.11 |
10986번 (gold 3) (0) | 2025.01.09 |
11660번 (silver 1) (0) | 2025.01.09 |