제출 #690719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
690719		andrei_iorgulescu	Table Tennis (info1cup20_tabletennis)	C++14	87 / 100	3044 ms	4608 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;

int n,k,a[150500];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> k;
    for (int i = 1; i <= n + k; i++)
        cin >> a[i];
    sort(a + 1,a + n + k + 1);
    for (int i = 1; i <= k + 1; i++)
    {
        for (int j = n + k; j >= n - 1; j--)
        {
            int sum = a[i] + a[j];
            int st = i + 1,dr = j - 1;
            vector<int>sol;
            sol.push_back(a[i]);
            sol.push_back(a[j]);
            while (st < dr and sol.size() < n)
            {
                if (a[st] + a[dr] == sum)
                {
                    sol.push_back(a[st]);
                    sol.push_back(a[dr]);
                    st++;
                    dr--;
                }
                else if (a[st] + a[dr] > sum)
                    dr--;
                else
                    st++;
            }
            if (sol.size() == n)
            {
                sort(sol.begin(),sol.end());
                for (int j = 0; j < n; j++)
                    cout << sol[j] << ' ';
                return 0;
            }
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:25:43: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |             while (st < dr and sol.size() < n)
      |                                ~~~~~~~~~~~^~~
tabletennis.cpp:39:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |             if (sol.size() == n)
      |                 ~~~~~~~~~~~^~~~

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 0 / 13