제출 #423366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423366		Amylopectin	Best Place (NOI17_bestplace)	C++14	100 / 100	54 ms	3012 KiB

bestplace

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int mxn = 4e5 + 10;
int x[mxn] = {},y[mxn] = {};
int main()
{
    int i,j,n,m;
    scanf("%d",&n);
    for(i=0; i<n; i++)
    {
        scanf("%d %d",&x[i],&y[i]);
    }
    sort(x,x+n);
    sort(y,y+n);
    printf("%d %d\n",x[n/2],y[n/2]);
    return 0;
}

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

bestplace.cpp: In function 'int main()':
bestplace.cpp:9:11: warning: unused variable 'j' [-Wunused-variable]
    9 |     int i,j,n,m;
      |           ^
bestplace.cpp:9:15: warning: unused variable 'm' [-Wunused-variable]
    9 |     int i,j,n,m;
      |               ^
bestplace.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
bestplace.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         scanf("%d %d",&x[i],&y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19