제출 #667609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
667609		eric	Table Tennis (info1cup20_tabletennis)	C++14	20 / 100	40 ms	2892 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k, wrong;
    scanf("%d %d", &n, &k);
    long long int v[n + k], som = 0;
    for(int i = 0; i < n + k; i++){
        scanf("%lld", &v[i]);
        som += v[i];
    }
    for(int i = 0; i < n + k; i++){
        long long int m = (som - v[i])*2;
        if(m%n != 0){
            //printf("%d %d\n", som, v[i]);
            continue;
        }
        m /= n;
        long long int comp;
        if(i == 0)comp = v[1] + v[n + k - 1];
        else if(i == n + k - 1)comp = v[0] + v[n + k - 2];
        else comp = v[0] + v[n + k - 1];
        //printf("%f %f\n", m, comp);
        if(m == comp){
            wrong = v[i];
            break;
        }
    }
    //sort(v, v + (n + k));
    for(int i = 0; i < n + k; i++){
        if(v[i] == wrong)continue;
        printf("%d ", v[i]);
    }
}

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:33:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   33 |         printf("%d ", v[i]);
      |                 ~^    ~~~~
      |                  |       |
      |                  int     long long int
      |                 %lld
tabletennis.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
tabletennis.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         scanf("%lld", &v[i]);
      |         ~~~~~^~~~~~~~~~~~~~~
tabletennis.cpp:32:20: warning: 'wrong' may be used uninitialized in this function [-Wmaybe-uninitialized]
   32 |         if(v[i] == wrong)continue;
      |                    ^~~~~

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