제출 #208976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
208976		davitmarg	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	5 ms	376 KiB

ho_t1

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 200005;

int n, a[N], b[N], sf[N], pr[N];

int main()
{
	cin >> n;
	for (int i = 1; i <= n + 1; i++)
		scanf("%d", a + i);
	for (int i = 1; i <= n; i++)
		scanf("%d", b + i);
	sort(a + 1, a + 1 + n + 1);
	sort(b + 1, b + 1 + n);


	for (int i = 1; i <= n; i++)
		pr[i] = max(pr[i - 1], a[i] - b[i]);

	for (int i = n; i >= 1; i--)
		sf[i] = max(sf[i + 1], a[i + 1] - b[i]);

	for (int i = 0; i <= n; i++)
		printf("%d ", max(pr[i], sf[i + 1]));
	cout << endl;
	return 0;
}

/*



*/

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

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
   ~~~~~^~~~~~~~~~~~~
ho_t1.cpp:36:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", b + i);
   ~~~~~^~~~~~~~~~~~~

• Subtask 1: 0 / 1
• Subtask 2: 0 / 8
• Subtask 3: 0 / 91