oj.uz

Submission #243953

# Submission time Handle Problem Language Result Execution time Memory
243953 2020-07-02T11:14:28 Z arnold518 Best Place (NOI17_bestplace) C++14
100 / 100
 56 ms 1152 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N;
int A[MAXN+10], B[MAXN+10];

int main()
{
	int i, j;

	scanf("%d", &N);
	for(i=1; i<=N; i++) scanf("%d%d", &A[i], &B[i]);
	sort(A+1, A+N+1);
	sort(B+1, B+N+1);
	printf("%d %d\n", A[(N+1)/2], B[(N+1)/2]);
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:15:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
bestplace.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
bestplace.cpp:18:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%d%d", &A[i], &B[i]);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1144 KB Output is correct
2 Correct 38 ms 1144 KB Output is correct
3 Correct 40 ms 1148 KB Output is correct
4 Correct 30 ms 1152 KB Output is correct
5 Correct 36 ms 1144 KB Output is correct
6 Correct 39 ms 1152 KB Output is correct
7 Correct 39 ms 1148 KB Output is correct
8 Correct 37 ms 1152 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 1144 KB Output is correct
2 Correct 56 ms 1144 KB Output is correct
3 Correct 41 ms 1144 KB Output is correct
4 Correct 50 ms 1144 KB Output is correct
5 Correct 55 ms 1020 KB Output is correct
6 Correct 52 ms 1148 KB Output is correct
7 Correct 56 ms 1144 KB Output is correct
8 Correct 55 ms 1144 KB Output is correct