Submission #2835925


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using VI = vector<int>;
using VVI = vector<VI>;

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  int n, c; cin >> n >> c;
  VI l(n); for (int i = 0; i < n; i++) cin >> l[i];
  sort(l.begin(), l.end());
  int res = n;
  int p = n - 1;
  for (int i = 0; i < n; i++) {
    while (i < p and l[i] + l[p] >= c) p--;
    if (i >= p) break;
    res--;
    p--;
  }
  cout << res << '\n';
  return 0;
}

Submission Info

Submission Time
Task C - 収納
User risujiroh
Language C++14 (GCC 5.4.1)
Score 300
Code Size 494 Byte
Status AC
Exec Time 17 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 17 ms 640 KB
02.txt AC 17 ms 640 KB
03.txt AC 14 ms 640 KB
04.txt AC 17 ms 640 KB
05.txt AC 11 ms 640 KB
06.txt AC 8 ms 640 KB
07.txt AC 10 ms 640 KB
08.txt AC 15 ms 640 KB
09.txt AC 15 ms 640 KB
10.txt AC 8 ms 640 KB
11.txt AC 17 ms 640 KB
12.txt AC 17 ms 640 KB
13.txt AC 13 ms 640 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB