mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-08 02:13:51 +08:00
upload some new code
This commit is contained in:
35
FZOI/纪念品分组.cpp
Normal file
35
FZOI/纪念品分组.cpp
Normal file
@ -0,0 +1,35 @@
|
||||
#include <bits/stdc++.h>
|
||||
#define int long long
|
||||
#define endl "\n"
|
||||
#define IMX LONG_LONG_MAX
|
||||
#define IMN LONG_LONG_MIN
|
||||
#define debug$ if(dev)
|
||||
using namespace std;
|
||||
|
||||
/* toothless. #17 */
|
||||
|
||||
const int N = 1e7 + 10;
|
||||
const int M = 2e3 + 5;
|
||||
const bool dev = false;
|
||||
|
||||
int w, ans = 0;
|
||||
int n, a[N];
|
||||
int l, r;
|
||||
|
||||
signed main()
|
||||
{
|
||||
cin >> w >> n;
|
||||
for (int i = 1; i <= n; i++) cin >> a[i];
|
||||
sort(a + 1, a + 1 + n);
|
||||
l = 1;
|
||||
r = n;
|
||||
while (l <= r) {
|
||||
if (a[l] + a[r] <= w) {
|
||||
l++, r--, ans++;
|
||||
} else {
|
||||
r--, ans++;
|
||||
}
|
||||
}
|
||||
cout << ans;
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user