답안 #423366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423366 2021-06-11T03:21:27 Z Amylopectin Best Place (NOI17_bestplace) C++14
100 / 100
54 ms 3012 KB
#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;
}

Compilation message

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]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 2124 KB Output is correct
2 Correct 35 ms 2204 KB Output is correct
3 Correct 32 ms 2256 KB Output is correct
4 Correct 25 ms 2252 KB Output is correct
5 Correct 29 ms 2164 KB Output is correct
6 Correct 33 ms 2252 KB Output is correct
7 Correct 31 ms 2060 KB Output is correct
8 Correct 30 ms 2124 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 2960 KB Output is correct
2 Correct 47 ms 2920 KB Output is correct
3 Correct 35 ms 3012 KB Output is correct
4 Correct 41 ms 2300 KB Output is correct
5 Correct 54 ms 2916 KB Output is correct
6 Correct 44 ms 2956 KB Output is correct
7 Correct 44 ms 3008 KB Output is correct
8 Correct 44 ms 3004 KB Output is correct