結果
| 問題 |
No.1251 絶対に間違ってはいけない最小化問題
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2020-09-03 07:53:43 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 671 bytes |
| コンパイル時間 | 1,769 ms |
| コンパイル使用メモリ | 173,000 KB |
| 実行使用メモリ | 8,064 KB |
| 最終ジャッジ日時 | 2024-07-20 06:23:42 |
| 合計ジャッジ時間 | 14,200 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 2 WA * 40 |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
from main.cpp:1:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
inlined from 'int main()' at main.cpp:32:10:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'X' may be used uninitialized [-Wmaybe-uninitialized]
202 | { return _M_insert(__n); }
| ~~~~~~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:19:19: note: 'X' was declared here
19 | long long X;
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N; cin >> N;
vector<long long>A(N), B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i);
}
long long sum = 0;
for (long long i = 0; i < N; i++) {
cin >> B.at(i);
sum += B.at(i);
}
vector<long long>C = A;
sort(C.begin(), C.end());
long long Mid = (sum + 1) / 2;
long long count = 0;
long long X;
bool check = false;
for (long long i = 0; i < N; i++) {
count += B.at(i);
if (count >= Mid && !check) {
X = A.at(i);
check = true;
}
}
long long ans = 0;
for (long long i = 0; i < N; i++) {
ans += B.at(i) * abs(X - A.at(i));
}
cout << X << ' ' << ans << endl;
}