text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
long long n, s, buy[1000005] = {0}, sell[1000005] = {0}, p, q;
int main() {
char c;
vector<long long> B, S, B2, S2;
cin >> n >> s;
for (int i = 0; i < n; ++i) {
cin >> c;
if (c == 'B') {
cin >> p >> q;
if (buy[p] == 0) B.push_back(p);
buy[p] += q;
} else {
cin >> p >> q;
if (sell[p] == 0) S.push_back(p);
sell[p] += q;
}
}
B2 = B;
S2 = S;
sort(B2.begin(), B2.end());
sort(S2.begin(), S2.end());
int x, y, zs, zb;
zs = S.size();
zb = B.size();
if (s > zs)
x = zs - 1;
else
x = s - 1;
if (zs != 0)
for (int i = x; i >= 0; --i) {
cout << "S " << S2[i] << " " << sell[S2[i]] << endl;
}
if (s > zb)
y = 0;
else
y = zb - s;
if (zb != 0)
for (int i = zb - 1; i >= y; --i) {
cout << "B " << B2[i] << " " << buy[B2[i]] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, s;
cin >> n >> s;
vector<pair<long long int, long long int> > vp;
char ch;
long long int p, v;
map<long long int, long long int> bp, sp;
vector<long long int> by, sy;
for (long long int i = 0; i < n; i++) {
cin >> ch >> p >> v;
if (ch == 'B')
bp[p] += v;
else
sp[p] += v;
}
for (auto it : bp) {
if (it.second > 0) by.push_back(it.first);
}
for (auto it : sp) {
if (it.second > 0) sy.push_back(it.first);
}
sort(by.begin(), by.end(), greater<long long int>());
sort(sy.begin(), sy.end());
vector<pair<long long int, long long int> > ans1, ans2;
long long int cnt = s;
for (auto it : by) {
ans1.push_back({it, bp[it]});
cnt--;
if (cnt == 0) break;
}
cnt = s;
for (auto it : sy) {
ans2.push_back({it, sp[it]});
cnt--;
if (cnt == 0) break;
}
sort(ans2.begin(), ans2.end(),
greater<pair<long long int, long long int> >());
for (auto it : ans2) {
cout << 'S' << " " << it.first << " " << it.second << "\n";
}
for (auto it : ans1) {
cout << "B"
<< " " << it.first << " " << it.second << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, a, b, n, s, ar1[100001], ar2[100001];
cin >> n >> s;
char ch;
for (i = 0; i < 100001; i++) {
ar1[i] = 0;
ar2[i] = 0;
}
for (i = 0; i < n; i++) {
cin >> ch;
cin >> a >> b;
if (ch == 'B')
ar1[a] += b;
else if (ch == 'S')
ar2[a] += b;
}
a = 0;
for (i = 0; i < 100001; i++) {
if (a >= s) break;
if (ar2[i] != 0) {
a++;
}
}
if (i <= 100000)
a = i - 1;
else
a = 100000;
for (i = a; i > 0; i--) {
if (ar2[i] != 0) {
cout << "S " << i << " " << ar2[i] << endl;
a++;
}
}
a = 0;
for (i = 100000; i >= 0; i--) {
if (a >= s) break;
if (ar1[i] != 0) {
cout << "B " << i << " " << ar1[i] << endl;
a++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int N = 101000;
long long n, k, m, s, p, q;
char d;
int buy[N], prod[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> d >> p >> q;
if (d == 'B')
buy[p] += q;
else
prod[p] += q;
}
int cnt = 0;
int M = 100100;
int val = 0;
for (int i = 0; i <= M; i++) {
if (prod[i]) cnt++, val = i;
if (cnt == s) break;
}
for (int i = val; i >= 0; i--) {
if (prod[i]) cout << "S " << i << " " << prod[i] << '\n';
}
cnt = 0;
for (int i = M; i >= 0; i--) {
if (buy[i]) {
cout << "B " << i << " " << buy[i] << '\n';
cnt++;
}
if (cnt == s) break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, s;
map<int, int> buy, sell;
cin >> n >> s;
for (int i = 0; i < n; ++i) {
char ch;
int a, b;
auto *that = &buy;
cin >> ch >> a >> b;
if (ch == 'S') that = &sell;
(*that)[a] += b;
}
int cnt = 0;
for (auto it = sell.rbegin(); it != sell.rend(); ++it, ++cnt)
if (cnt >= (int)sell.size() - s)
cout << "S " << (*it).first << " " << (*it).second << endl;
cnt = 0;
for (auto it = buy.rbegin(); it != buy.rend() && cnt != s; ++it, ++cnt)
cout << "B " << (*it).first << " " << (*it).second << endl;
return 0;
}
|
#include <bits/stdc++.h>
struct libros {
int precio;
int unidades;
};
int main() {
int n, s, pos, i, cant;
char c;
int auxVecB[100005], auxVecS[100005];
memset(auxVecB, 0, sizeof(auxVecB));
memset(auxVecS, 0, sizeof(auxVecS));
scanf("%d%d", &n, &s);
for (i = 0; i < n; i++) {
getchar();
scanf("%c%d%d", &c, &pos, &cant);
if (c == 'B')
auxVecB[pos] += cant;
else
auxVecS[pos] += cant;
}
int indB = 0, indS = 0;
struct libros venta[100005], compra[100005];
for (i = 0; i < 100005; i++) {
if (auxVecB[i]) {
venta[indB].precio = i;
venta[indB].unidades = auxVecB[i];
indB++;
}
if (auxVecS[i]) {
compra[indS].precio = i;
compra[indS].unidades = auxVecS[i];
indS++;
}
}
if (indS <= s)
for (i = indS - 1; i >= 0; i--)
printf("S %d %d\n", compra[i].precio, compra[i].unidades);
else
for (i = s - 1; i >= 0; i--)
printf("S %d %d\n", compra[i].precio, compra[i].unidades);
for (i = indB - 1; i >= 0 && i >= indB - s; i--)
printf("B %d %d\n", venta[i].precio, venta[i].unidades);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int cost, s;
};
node a[11000], b[11000];
int pos1[100010], pos2[100010], vis1[100010], vis2[100010];
bool cmp(node x, node y) { return x.cost > y.cost; }
bool cmp1(node x, node y) { return x.cost < y.cost; }
int main() {
int n, s;
while (~scanf("%d%d", &n, &s)) {
getchar();
int q, w;
memset(vis1, 0, sizeof(vis1));
memset(vis2, 0, sizeof(vis2));
int sum1 = 0, sum2 = 0;
char ch;
for (int i = 1; i <= n; i++) {
scanf("%c%d%d", &ch, &q, &w);
getchar();
if (ch == 'B') {
if (vis1[q] == 0) {
a[sum1].cost = q;
a[sum1].s = w;
pos1[q] = sum1;
sum1++;
vis1[q] = 1;
} else {
a[pos1[q]].s += w;
}
}
if (ch == 'S') {
if (vis2[q] == 0) {
b[sum2].cost = q;
b[sum2].s = w;
pos2[q] = sum2;
sum2++;
vis2[q] = 1;
} else {
b[pos2[q]].s += w;
}
}
}
sort(b, b + sum2, cmp1);
sort(a, a + sum1, cmp);
int minn = min(sum2, s);
for (int i = minn - 1; i >= 0; i--) printf("S %d %d\n", b[i].cost, b[i].s);
for (int i = 0; i < sum1 && i < s; i++)
printf("B %d %d\n", a[i].cost, a[i].s);
}
return 0;
}
|
#include <bits/stdc++.h>
template <typename T>
void xchg(T &a, T &b) {
T c = a;
a = b;
b = c;
}
using namespace std;
void _main();
int main() {
_main();
return 0;
}
typedef struct {
int d, p, q;
} Order;
int s, n;
map<pair<int, int>, Order> dict;
vector<Order> vo;
bool cmp(const Order &a, const Order &b) { return a.p < b.p; }
void _main() {
dict.clear();
cin >> n >> s;
for (int i = 0; i < n; ++i) {
char c;
int p, q;
cin >> c >> p >> q;
pair<int, int> key;
key = make_pair(c == 'B' ? 1 : 2, p);
if (dict.count(key)) {
dict[key].q += q;
} else {
dict[key] = (Order){key.first, key.second, q};
}
}
vo.clear();
for (map<pair<int, int>, Order>::iterator it = dict.begin(); it != dict.end();
++it) {
vo.push_back(it->second);
}
sort(vo.begin(), vo.end(), cmp);
int rem = s, i;
for (i = 0; i < vo.size() && rem > 0; ++i) {
if (vo[i].d == 2) {
--rem;
}
if (rem == 0) break;
}
for (; i >= 0; --i) {
if (vo[i].d == 2) {
printf("S %d %d\n", vo[i].p, vo[i].q);
}
}
rem = s;
for (i = vo.size() - 1; i >= 0 && rem > 0; --i) {
if (vo[i].d == 1) {
--rem;
printf("B %d %d\n", vo[i].p, vo[i].q);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int GCD(int x, int y) { return !y ? x : GCD(y, x % y); }
int LCM(int x, int y) { return x * y / GCD(x, y); }
long long ceilDivision(long long dividend, long long divisor) {
return (dividend + divisor - 1) / divisor;
}
bool check(long long left, long long right) { return left > right; }
long long arr1[100001], arr2[100001];
int main() {
map<long long, long long> s;
map<long long, long long> b;
long long n, m, temp2, temp3, counter = 0, tempm;
char temp1;
cin >> n >> m;
while (n--) {
cin >> temp1 >> temp2 >> temp3;
if (temp1 == 'B')
b[temp2] += temp3;
else
s[temp2] += temp3;
}
tempm = m;
map<long long, long long>::reverse_iterator it = s.rbegin();
if (s.size() > m)
for (it; tempm < s.size(); it++, tempm++)
;
for (; it != s.rend() && counter < m; it++, counter++)
cout << "S " << it->first << " " << it->second << endl;
counter = 0;
for (map<long long, long long>::reverse_iterator it = b.rbegin();
it != b.rend() && counter < m; it++, counter++)
cout << "B " << it->first << " " << it->second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
if (a < b) swap(a, b);
return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
int main() {
long long n, s;
cin >> n >> s;
map<long long, long long, greater<long long>> buy;
map<long long, long long> sell;
for (long long i = 0; i < n; ++i) {
char c;
cin >> c;
bool isBuy = (c == 'B');
long long p, q;
cin >> p >> q;
if (isBuy)
buy[p] += q;
else
sell[p] += q;
}
long long s_p[1000];
long long s_q[1000];
long long i = 0;
for (auto a : sell) {
s_p[i] = a.first;
s_q[i] = a.second;
i++;
if (i == s) break;
}
for (long long j = i - 1; j >= 0; j--) {
cout << "S " << s_p[j] << " " << s_q[j] << endl;
}
i = 0;
for (auto a : buy) {
cout << "B " << a.first << " " << a.second << endl;
i++;
if (i == s) break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int orders, depth;
cin >> orders >> depth;
long long int buy[100001] = {0};
long long int sell[100001] = {0};
long long int cnts = 0;
for (long long int i = 0; i < orders; i++) {
char ch;
cin >> ch;
long long int prc, num;
cin >> prc >> num;
if (ch == 'B')
buy[prc] += num;
else if (ch == 'S') {
sell[prc] += num;
cnts++;
}
}
long long int cnt = depth;
long long int mark;
for (long long int i = 0; i < 100001; i++) {
if (cnt == 0) break;
if (sell[i] != 0) {
cnt--;
mark = i;
}
}
if (cnts < depth) {
for (long long int i = 100000; i >= 0; i--)
if (sell[i] != 0) {
if (sell[i] != 0) printf("S %lli %lli\n", i, sell[i]);
}
} else if (cnts >= depth) {
for (long long int i = mark; i >= 0; i--)
if (sell[i] != 0) printf("S %lli %lli\n", i, sell[i]);
}
long long int cntb = 0;
for (long long int i = 100000; i >= 0; i--) {
if (cntb == depth) break;
if (buy[i] != 0) {
printf("B %lli %lli\n", i, buy[i]);
cntb++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
map<int, int> buy;
map<int, int> sell;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
int p, q;
cin >> p >> q;
if (c == 'B') {
map<int, int>::iterator it = buy.find(p);
if (it == buy.end()) {
buy.insert(make_pair(p, q));
} else {
(*it).second += q;
}
} else {
map<int, int>::iterator it = sell.find(p);
if (it == sell.end()) {
sell.insert(make_pair(p, q));
} else {
(*it).second += q;
}
}
}
vector<pair<int, int> > seller;
int i = 0;
for (map<int, int>::iterator it = sell.begin(); it != sell.end(); it++) {
seller.push_back(make_pair(it->first, it->second));
i++;
if (i == s) break;
}
for (int j = seller.size() - 1; j >= 0; j--) {
cout << "S " << seller[j].first << " " << seller[j].second << endl;
}
i = 0;
for (map<int, int>::reverse_iterator it = buy.rbegin(); it != buy.rend();
++it) {
cout << "B " << it->first << " " << it->second << endl;
i++;
if (i == s) break;
}
}
|
#include <bits/stdc++.h>
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
template <class T>
inline T bigmod(T p, T e, T m) {
T ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % m;
p = (p * p) % m;
}
return (T)ret;
}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(10);
cout.tie(nullptr);
cin.tie(nullptr);
int n, s;
cin >> n >> s;
map<long long, int> buys, sells;
for (int i = 0; i < n; i++) {
char b;
cin >> b;
if (b == 'B') {
int pr, q;
cin >> pr >> q;
buys[pr] = buys[pr] + q;
} else {
int pr, q;
cin >> pr >> q;
sells[pr] = sells[pr] + q;
}
}
vector<pair<int, int>> sls;
for (int i = 1; i <= s; i++) {
if (sells.size() > 0) {
auto last = sells.begin();
sls.push_back(*last);
sells.erase(last);
}
}
reverse(sls.begin(), sls.end());
for (int i = 0; i < sls.size(); i++) {
cout << "S " << sls[i].first << " " << sls[i].second << endl;
}
for (int i = 1; i <= s; i++) {
if (buys.size() > 0) {
auto last = --buys.end();
cout << "B " << last->first << " " << last->second << endl;
buys.erase(last);
}
}
pause:
int pause;
cin >> pause;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s1, i, j, x, y, count = 0, a[1000000];
char s;
map<int, int> v1;
map<int, int> v2;
cin >> n >> s1;
for (i = 0; i < n; i++) {
cin >> s >> x >> y;
if (s == 'S')
v1[x] += y;
else
v2[x] += y;
}
map<int, int>::reverse_iterator it;
count = 0;
i = 0;
map<int, int>::iterator it1;
for (it1 = v1.begin(); it1 != v1.end(); it1++) {
count++;
a[i++] = it1->first;
if (count >= s1) break;
}
for (i = count - 1; i >= 0; i--)
cout << 'S' << ' ' << a[i] << ' ' << v1[a[i]] << endl;
count = 0;
for (it = v2.rbegin(); it != v2.rend(); it++) {
count++;
cout << 'B' << ' ' << it->first << ' ' << it->second << endl;
if (count >= s1) break;
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> buy, sell;
int v[105], c = 0;
int main() {
int n, s;
cin >> n >> s;
char directie;
int price, qq;
while (n--) {
cin >> directie;
cin >> price >> qq;
if (directie == 'B') {
buy[-1 * price] += qq;
} else {
sell[price] += qq;
}
}
int i = 0;
for (map<int, int>::iterator it = sell.begin(); it != sell.end() && i < s;
it++) {
v[c + 2] = it->first;
v[c + 1] = it->second;
c += 2;
i++;
}
for (int i = c; i > 1; i -= 2) {
cout << "S " << v[i] << ' ' << v[i - 1] << '\n';
}
i = 0;
for (map<int, int>::iterator it = buy.begin(); it != buy.end() && i < s;
it++) {
cout << "B " << -1 * it->first << ' ' << it->second << '\n';
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
char dir;
int p, q;
map<int, int> buy;
map<int, int> sell;
for (int i = 0; i < n; i++) {
cin >> dir >> p >> q;
if (dir == 'B') {
map<int, int>::iterator f = buy.find(p);
if (f == buy.end()) {
buy[p] = q;
} else {
buy[p] += q;
}
} else {
map<int, int>::iterator f = sell.find(p);
if (f == sell.end()) {
sell[p] = q;
} else {
sell[p] += q;
}
}
}
vector<int> buy_vec;
vector<int> sell_vec;
for (map<int, int>::iterator it = buy.begin(); it != buy.end(); it++) {
buy_vec.push_back(it->first);
}
for (map<int, int>::iterator it = sell.begin(); it != sell.end(); it++) {
sell_vec.push_back(it->first);
}
sort(buy_vec.begin(), buy_vec.end());
sort(sell_vec.begin(), sell_vec.end());
for (int i = s - 1; i >= 0; i--) {
if (i >= sell_vec.size()) continue;
printf("%s %d %d\n", "S", sell_vec.at(i), sell[sell_vec.at(i)]);
}
int size = buy_vec.size();
for (int i = size - 1; i >= 0 && i > size - 1 - s; i--) {
printf("%s %d %d\n", "B", buy_vec.at(i), buy[buy_vec.at(i)]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
char op[100010];
int pre[100010];
int main() {
int n, s;
cin >> n >> s;
memset(pre, 0, sizeof(pre));
for (int i = 0; i < n; i++) {
char ch[3];
int x, y;
scanf("%s%d%d", ch, &x, &y);
op[x] = ch[0];
pre[x] += y;
}
int d = s;
stack<pair<int, int> > st;
for (int i = 0; i < 100010 && d > 0; i++) {
if (op[i] == 'S') {
st.push(make_pair(i, pre[i]));
d--;
}
}
while (!st.empty()) {
pair<int, int> a = st.top();
st.pop();
printf("S %d %d\n", a.first, a.second);
}
for (int i = 100009; i >= 0 && s > 0; i--) {
if (op[i] == 'B') {
printf("B %d %d\n", i, pre[i]);
s--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, s;
cin >> n >> s;
map<pair<string, long long>, long long> mp;
for (long long i = 0; i < n; i++) {
string s;
long long p, q;
cin >> s >> p >> q;
mp[{s, p}] += q;
}
priority_queue<pair<long long, long long> > sell, buy;
for (auto el : mp) {
if (el.first.first == "S") {
sell.push({-el.first.second, el.second});
} else {
buy.push({el.first.second, el.second});
}
}
stack<pair<long long, long long> > ansSell;
for (long long i = 0; i < s && !sell.empty(); i++) {
ansSell.push({-sell.top().first, sell.top().second});
sell.pop();
}
while (!ansSell.empty()) {
cout << "S " << ansSell.top().first << " " << ansSell.top().second << "\n";
ansSell.pop();
}
for (long long i = 0; i < s && !buy.empty(); i++) {
cout << "B " << buy.top().first << " " << buy.top().second << "\n";
buy.pop();
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
struct order {
long long price;
long long qty;
};
bool vis[2][100005];
int ind[2][100005];
bool cmp(order a, order b) {
if (a.price != b.price) {
return a.price < b.price;
} else
return a.qty < b.qty;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, s;
cin >> n >> s;
order st[2][n];
char dir;
int pr, qt;
int k1 = 0, k2 = 0;
for (int i = 0; i < n; i++) {
cin >> dir >> pr >> qt;
if (dir == 'B') {
if (vis[0][pr]) {
int id = ind[0][pr];
st[0][id].qty += qt;
} else {
st[0][k1].price = pr;
st[0][k1].qty = qt;
vis[0][pr] = 1;
ind[0][pr] = k1;
k1++;
}
} else {
if (vis[1][pr]) {
int id = ind[1][pr];
st[1][id].qty += qt;
} else {
st[1][k2].price = pr;
st[1][k2].qty = qt;
vis[1][pr] = 1;
ind[1][pr] = k2;
k2++;
}
}
}
sort(st[0], st[0] + k1, cmp);
sort(st[1], st[1] + k2, cmp);
order ans[2 * s];
for (int i = 0; i < 2 * s; i++) {
ans[i].price = -1;
}
int l = s - 1;
for (int i = k1 - 1; i >= 0; i--) {
if (l < 0) break;
ans[l] = st[0][i];
l--;
}
l = s;
for (int i = 0; i < k2; i++) {
if (l == 2 * s) break;
ans[l] = st[1][i];
l++;
}
for (int i = 2 * s - 1; i >= 0; i--) {
if (ans[i].price != -1) {
if (i >= s)
cout << 'S' << " " << ans[i].price << " " << ans[i].qty << "\n";
else
cout << 'B' << " " << ans[i].price << " " << ans[i].qty << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<pair<int, int> > temp;
int sell[100100], buy[100100], ctr, n, s;
for (int(i) = 0; (i) < (100100); (i)++) buy[i] = sell[i] = 0;
cin >> n >> s;
for (int(i) = 0; (i) < (n); (i)++) {
int a, b;
char ch;
cin >> ch >> a >> b;
if (ch == 'S')
sell[a] += b;
else
buy[a] += b;
}
ctr = 0;
for (int(i) = 0; (i) < (100010); (i)++) {
if (sell[i] > 0 and ctr < s) {
temp.push_back(make_pair(i, sell[i]));
ctr++;
}
}
int sz = temp.size();
for (int(i) = 0; (i) < (sz); (i)++)
cout << "S " << temp[sz - i - 1].first << " " << temp[sz - i - 1].second
<< "\n";
ctr = 0;
for (int i = 100010; i >= 0; i--) {
if (buy[i] > 0 and ctr < s) {
cout << "B " << i << " " << buy[i] << "\n";
ctr++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp1, mp2;
map<int, int>::reverse_iterator it1;
map<int, int>::iterator it2;
typedef struct ans {
int p, q;
char d;
friend bool operator<(ans a, ans b) { return a.p > b.p; }
ans(int p = 0, int q = 0, char d = 0) : p(p), q(q), d(d) {}
} ans;
ans A[1000];
int n, s;
int main() {
cin >> n >> s;
char d[10];
int p, q;
for (int i = 0; i < n; i++) {
scanf("%s%d%d", d, &p, &q);
if (d[0] == 'S') {
mp1[p] += q;
} else
mp2[p] += q;
}
int i = 0, c = 0;
for (it2 = mp1.begin(); it2 != mp1.end() && i < s; it2++, i++) {
A[c++] = ans((*it2).first, (*it2).second, 'S');
}
i = 0;
for (it1 = mp2.rbegin(); it1 != mp2.rend() && i < s; it1++, i++) {
A[c++] = ans((*it1).first, (*it1).second, 'B');
}
sort(A, A + c);
for (int i = 0; i < c; i++) printf("%c %d %d\n", A[i].d, A[i].p, A[i].q);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
map<int, int> sl;
map<int, int> by;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
void solve() {
int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
char d;
cin >> d;
int p, q;
cin >> p >> q;
if (d == 'S') {
sl[p] += q;
} else {
by[p] += q;
}
}
map<int, int>::reverse_iterator ri = sl.rbegin();
int i = 0;
while (i < sl.size() - s && sl.size() > s) i++, ri++;
while (ri != sl.rend()) {
cout << "S " << (*ri).first << " " << (*ri).second << "\n";
ri++;
}
ri = by.rbegin();
i = 0;
while (ri != by.rend() && i < s) {
i++;
cout << "B " << (*ri).first << " " << (*ri).second << "\n";
ri++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793;
const long long MOD = 1e9 + 7;
const int N = 1e3 + 10, P = 1e5 + 10;
int n, s;
int sell[N], buy[N];
int indSell, indBuy;
int markSell[P], markBuy[P];
int main() {
cin >> n >> s;
char t;
int p, q;
for (int i = 0; i < n; i++) {
cin >> t >> p >> q;
if (t == 'S') {
sell[indSell++] = p;
markSell[p] += q;
} else {
buy[indBuy++] = p;
markBuy[p] += q;
}
}
sort(sell, sell + indSell);
indSell = unique(sell, sell + indSell) - sell;
sort(buy, buy + indBuy, greater<int>());
indBuy = unique(buy, buy + indBuy) - buy;
for (int i = min(indSell, s) - 1; i >= 0; i--)
cout << "S " << sell[i] << " " << markSell[sell[i]] << endl;
for (int i = 0; i < min(indBuy, s); i++)
cout << "B " << buy[i] << " " << markBuy[buy[i]] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ar[1111111], br[1111111];
char chr[1111111], dhr[1111111], ans1[11111];
pair<long long, long long> ans[111111];
int main() {
long long maxx, maxx1, n, s, i, j, inp, inq;
cin >> n >> s;
char ch;
maxx = maxx1 = INT_MIN;
memset(ar, 0, sizeof(ar));
memset(br, 0, sizeof(br));
while (n--) {
cin >> ch >> inp >> inq;
if (ch == 'S') {
chr[inp] = ch;
ar[inp] += inq;
} else {
dhr[inp] = ch;
br[inp] += inq;
}
}
int coun = 0;
for (i = 0; i <= 111111; i++) {
if (ar[i] > 0) {
coun++;
ans[coun] = make_pair(i, ar[i]);
ans1[coun] = chr[i];
}
if (coun == s) break;
}
for (i = coun; i > 0; i--)
cout << ans1[i] << " " << ans[i].first << " " << ans[i].second << endl;
coun = 0;
for (i = 111111; i >= 0; i--) {
if (br[i] > 0) {
cout << dhr[i] << " " << i << " " << br[i] << endl;
coun++;
}
if (coun == s) break;
}
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("input.txt");
ofstream fout("output.txt");
const int Mod = 1000000007;
const int Max = 100003;
int N, s;
pair<long long, long long> a[333333], b[333333];
pair<long long, long long> B[100];
pair<long long, long long> S[100];
map<long long, long long> ms;
map<long long, long long> mb;
int main() {
cin >> N >> s;
if (s == 0) {
return 0;
}
char str;
int k = 0, k2 = 0;
for (int i = 0; i < N; i++) {
cin >> str;
if (str == 'B') {
cin >> a[k2].first >> a[k2].second;
k2++;
} else {
cin >> b[k].first >> b[k].second;
k++;
}
}
sort(a, a + k2);
sort(b, b + k);
for (int i = 0; i < k2; i++) mb[a[i].first] += a[i].second;
for (int i = 0; i < k; i++) ms[b[i].first] += b[i].second;
{
int k = 0;
for (int i = 0; i < Max && k < s; i++)
if (ms[i] != 0) {
S[k].first = i;
S[k].second = ms[i];
k++;
}
for (int i = k - 1; i >= 0; i--)
cout << 'S' << ' ' << S[i].first << ' ' << S[i].second << endl;
k = 0;
for (int i = Max; i >= 0 && k < s; i--)
if (mb[i] != 0) {
cout << 'B' << ' ' << i << ' ' << mb[i] << endl;
k++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> k;
map<int, int> l;
int x[1110111], y[1110111], a[1110111], b[1110111], sz, sz2;
int main() {
int n, s;
char c;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> c >> x[i] >> y[i];
if (c == 'S') {
if (k[x[i]] == 0) a[++sz] = x[i];
k[x[i]] += y[i];
}
if (c == 'B') {
if (l[x[i]] == 0) b[++sz2] = x[i];
l[x[i]] += y[i];
}
}
sort(a + 1, a + sz + 1);
for (int i = min(s, sz); i >= 1; i--) {
int u = k[a[i]];
k[a[i]] -= l[a[i]];
l[a[i]] -= u;
if (k[a[i]] > 0) cout << "S " << a[i] << " " << k[a[i]] << endl;
}
sort(b + 1, b + sz2 + 1);
for (int i = sz2; i >= sz2 - min(s, sz2) + 1; i--) {
if (l[b[i]] > 0) cout << "B " << b[i] << " " << l[b[i]] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
struct asd {
char ch;
int x, y, p;
} a[N], v[N];
bool cmp(asd p1, asd p2) { return (p1.x < p2.x); }
bool cmp1(asd p1, asd p2) { return (p1.x > p2.x); }
int main() {
int n, s;
cin >> n >> s;
for (int i = 1; i <= n; i++) {
char ch;
int x, y;
cin >> a[i].ch >> a[i].x >> a[i].y;
a[i].p = i;
}
sort(a + 1, a + 1 + n, cmp);
int kol = 0;
for (int i = 1; i <= n; i++) {
if (a[i].ch == 'S' && a[i].x == v[kol].x) {
v[kol].y += a[i].y;
continue;
}
if (a[i].ch == 'S' && kol + 1 <= s) {
v[++kol] = a[i];
continue;
}
}
int kol1 = 0;
for (int i = n; i >= 1; i--) {
if (a[i].ch == 'B' && a[i].x == v[kol].x) {
v[kol].y += a[i].y;
continue;
}
if (a[i].ch == 'B' && kol1 + 1 <= s) {
v[++kol] = a[i];
kol1++;
continue;
}
}
sort(v + 1, v + 1 + kol, cmp1);
for (int i = 1; i <= kol; i++) {
cout << v[i].ch << " " << v[i].x << " " << v[i].y << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int inf = 0x7ffffff;
const int maxn = 1000 + 5, maxp = 1e5 + 5;
int B_ind[maxp], S_ind[maxp];
struct buy {
int p, q;
} B[maxn];
struct sell {
int p, q, ind;
} S[maxn];
bool cmpb(const buy &a, const buy &b) { return a.p > b.p; }
bool cmps(const sell &a, const sell &b) { return a.p < b.p; }
bool ccc(const sell &a, const sell &b) { return a.p > b.p; }
int main() {
int n, s;
scanf("%d%d", &n, &s);
int i = 1, j = 1;
char c[3];
int price, vol;
for (int k = 0; k < n; k++) {
scanf("%s %d %d", c, &price, &vol);
if (c[0] == 'B') {
if (B_ind[price] == 0) {
B_ind[price] = i;
B[i] = {price, vol};
i++;
} else {
B[B_ind[price]].q += vol;
}
} else {
if (S_ind[price] == 0) {
S_ind[price] = j;
S[j] = {price, vol, j};
j++;
} else {
S[S_ind[price]].q += vol;
}
}
}
sort(B + 1, B + i, cmpb);
sort(S + 1, S + j, cmps);
int temp = min(s + 1, j);
sort(S + 1, S + temp, ccc);
for (int k = 1; k < temp; k++) printf("S %d %d\n", S[k].p, S[k].q);
for (int k = 1; k <= s && k < i; k++) printf("B %d %d\n", B[k].p, B[k].q);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct classcomp {
bool operator()(const int& lhs, const int& rhs) const { return lhs > rhs; }
};
map<int, int, classcomp> bm, ssm;
map<int, int> sm;
void __main() {
int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
char ch;
int p, q;
cin >> ch >> p >> q;
if (ch == 'B') {
if (bm.find(p) == bm.end())
bm[p] = q;
else
bm[p] += q;
} else {
if (sm.find(p) == sm.end())
sm[p] = q;
else
sm[p] += q;
}
}
int cnt = 0;
for (auto it = sm.begin(); it != sm.end(); it++) {
if (cnt >= s) break;
ssm[it->first] = it->second;
cnt++;
}
for (auto it = ssm.begin(); it != ssm.end(); it++)
cout << "S " << it->first << " " << it->second << endl;
cnt = 0;
for (auto it = bm.begin(); it != bm.end(); it++) {
if (cnt >= s) break;
cout << "B " << it->first << " " << it->second << endl;
cnt++;
}
}
int main() {
__main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, second;
cin >> n >> second;
map<int, int> buy, sell;
while (n--) {
char d;
int p, v;
cin >> d >> p >> v;
if (d == 'S')
sell[p] += v;
else
buy[p] += v;
}
vector<pair<int, int> > bb, ss;
for (auto &x : buy) bb.push_back(x);
for (auto &x : sell) ss.push_back(x);
vector<pair<int, int> > a;
for (int i = 0; i < second and i < ss.size(); i++) a.push_back(ss[i]);
reverse(a.begin(), a.end());
for (auto &x : a) cout << 'S' << " " << x.first << " " << x.second << endl;
reverse(bb.begin(), bb.end());
for (int i = 0; i < second and i < bb.size(); i++)
cout << 'B' << " " << bb[i].first << " " << bb[i].second << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct lol {
long long c, n, m, v;
char d;
};
vector<lol> a, s;
vector<lol> b;
int ans, n, l, r, rr, S;
bool comp(lol a, lol b) { return (a.c > b.c || (a.c == b.c && a.n < b.n)); }
bool compp(lol a, lol b) { return (a.c < b.c || (a.c == b.c && a.n < b.n)); }
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> S;
for (int i = 0; i < n; i++) {
lol t;
cin >> t.d >> t.c >> t.v;
t.n = i;
if (t.d == 'B') {
b.push_back(t);
} else {
s.push_back(t);
}
}
sort(b.begin(), b.end(), comp);
sort(s.begin(), s.end(), compp);
for (int i = 1; i < b.size(); i++) {
if (b[i].c == b[i - 1].c) {
b[i - 1].v += b[i].v;
b.erase(b.begin() + i);
i--;
}
}
for (int i = 1; i < s.size(); i++) {
if (s[i].c == s[i - 1].c) {
s[i - 1].v += s[i].v;
s.erase(s.begin() + i);
i--;
}
}
int x = s.size();
sort(s.begin(), s.begin() + min(x, S), comp);
for (int i = 0; i < min(S, x); i++) {
cout << s[i].d << ' ' << s[i].c << ' ' << s[i].v << endl;
}
x = b.size();
for (int i = 0; i < min(S, x); i++) {
cout << b[i].d << ' ' << b[i].c << ' ' << b[i].v << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void zuka() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main() {
zuka();
int n, s;
cin >> n >> s;
map<long long, long long> buy_orders;
map<long long, long long> sell_orders;
vector<pair<long long, long long>> v(1005);
set<long long> unique_sold;
set<long long> unique_buys;
for (int i = 0; i < n; i++) {
char direction;
cin >> direction;
long long price, q;
cin >> price >> q;
if (direction == 'B') {
unique_buys.insert(price);
buy_orders[price] += q;
} else {
unique_sold.insert(price);
sell_orders[price] += q;
}
}
for (int i = 0; i < s && !unique_sold.empty(); i++) {
v[i].first = *unique_sold.begin();
v[i].second = sell_orders[*unique_sold.begin()];
unique_sold.erase(*unique_sold.begin());
}
sort(v.begin(), v.end(), greater<pair<long long, long long>>());
for (int i = 0; v[i].first != 0; i++) {
cout << 'S' << ' ' << v[i].first << ' ' << v[i].second << '\n';
}
for (int i = 0; i < s && !unique_buys.empty(); i++) {
cout << 'B' << " " << *unique_buys.rbegin() << " "
<< buy_orders[*unique_buys.rbegin()] << '\n';
unique_buys.erase(*unique_buys.rbegin());
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
map<int, int> mp, mp1;
cin >> n >> s;
char ch;
int b, d;
for (int i = 0; i < n; i++) {
cin >> ch >> b >> d;
if (ch == 'B') {
map<int, int>::iterator it;
it = mp.find(b);
if (it != mp.end()) {
mp[b] += d;
} else if (it == mp.end()) {
mp[b] = d;
}
} else if (ch == 'S') {
map<int, int>::iterator it;
it = mp1.find(b);
if (it != mp1.end()) {
mp1[b] += d;
} else if (it == mp1.end()) {
mp1[b] = d;
}
}
}
stack<pair<int, int> > sta;
pair<int, int> p, p1;
map<int, int>::iterator i, itr1 = mp1.begin();
int count = 0;
for (i = itr1; i != mp1.end() && count++ < s; i++) {
p.first = i->first;
p.second = i->second;
sta.push(p);
}
while (!sta.empty()) {
p1 = sta.top();
cout << "S " << p1.first << " " << p1.second << endl;
sta.pop();
}
map<int, int>::reverse_iterator j, itr = mp.rbegin();
count = 0;
for (j = itr; j != mp.rend() && count++ < s; j++) {
cout << "B " << j->first << " " << j->second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int N, S;
int main(void) {
cin >> N >> S;
map<int, int> mab, mas;
for (int i = 0; i < (int)(N); ++i) {
char d;
int p, q;
cin >> d >> p >> q;
if (d == 'B')
mab[p] += q;
else
mas[p] += q;
}
vector<pair<int, int> > vs, vb;
for (auto p : mab) vb.push_back(p);
for (auto p : mas) vs.push_back(p);
sort(vb.begin(), vb.end());
sort(vs.begin(), vs.end());
reverse(vb.begin(), vb.end());
for (int i = min((int)vs.size(), S) - 1; i >= 0; i--)
cout << "S " << vs[i].first << " " << vs[i].second << endl;
for (int i = 0; i < (int)(min((int)vb.size(), S)); ++i)
cout << "B " << vb[i].first << " " << vb[i].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, s;
cin >> n >> s;
map<pair<char, long>, long> m;
vector<pair<long, long> > S, B;
for (int i = 0; i < n; ++i) {
char ch;
long p, q;
cin >> ch >> p >> q;
m[make_pair(ch, p)] += q;
}
map<pair<char, long>, long>::iterator it;
for (it = m.begin(); it != m.end(); ++it) {
if (it->first.first == 'S')
S.push_back(make_pair(it->first.second, it->second));
else
B.push_back(make_pair(it->first.second, it->second));
}
sort(S.rbegin(), S.rend());
sort(B.rbegin(), B.rend());
for (int i = max(0l, (long)S.size() - s);
i < min(s, (long)S.size()) + max(0l, (long)S.size() - s); ++i)
cout << 'S' << ' ' << S[i].first << ' ' << S[i].second << endl;
for (int i = 0; i < min(s, (long)B.size()); ++i)
cout << 'B' << ' ' << B[i].first << ' ' << B[i].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int sell[100002] = {0}, buy[100002] = {0};
int main() {
int n, s, p, q;
char c;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> c >> p >> q;
if (c == 'S') {
sell[p] += q;
} else
buy[p] += q;
}
int w, r;
w = s;
r = s;
vector<string> vec;
for (int i = 0; i <= 100000; i++) {
string str;
if (w && sell[i]) {
str += "S ";
int k = i;
stringstream ss;
ss << k;
string st = ss.str();
str += st;
long int p = sell[i];
stringstream ss2;
ss2 << p;
string st2 = ss2.str();
str += " " + st2;
vec.push_back(str);
w--;
}
}
reverse(vec.begin(), vec.end());
for (vector<string>::iterator it = vec.begin(); it != vec.end(); it++)
cout << *it << endl;
for (int i = 100000; i >= 0; i--) {
if (r && buy[i]) {
cout << "B " << i << " " << buy[i] << endl;
r--;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100002;
int n, s;
int buy[maxn];
int sell[maxn];
int main() {
memset(buy, 0, sizeof(buy));
memset(sell, 0, sizeof(sell));
cin >> n >> s;
char d;
int p, q, i, t = 0, bp = 0;
for (i = 0; i < n; ++i) {
cin >> d >> p >> q;
if (d == 'B') {
buy[p] += q;
if (p > bp) bp = p;
} else
sell[p] += q;
}
for (i = 0; i <= 100000; i++) {
if (t < s && sell[i]) {
t++;
p = i;
} else if (t >= s)
break;
}
for (i = p; i >= 0; i--) {
if (sell[i])
cout << "S"
<< " " << i << " " << sell[i] << endl;
}
t = 0;
for (i = bp; i >= 0; i--) {
if (t < s && buy[i]) {
cout << "B"
<< " " << i << " " << buy[i] << endl;
t++;
}
if (t >= s) break;
}
return 0;
}
|
#include <bits/stdc++.h>
void get(long *nums, long p, int upd, std::vector<long> &index, int s) {
while (s > 0 && p >= 0 && p < 100001) {
if (nums[p] > 0) {
index.push_back(p);
--s;
}
p += upd;
}
}
void disp(std::vector<long> &nums, int p, int upd, long *quant, char type) {
while (p >= 0 && p < nums.size()) {
std::cout << type << " " << nums[p] << " " << quant[nums[p]] << std::endl;
p += upd;
}
}
int main() {
int n, s;
std::cin >> n >> s;
long buy[100001] = {0}, sell[100001] = {0};
while (n--) {
char type;
long price, quant;
std::cin >> type >> price >> quant;
if (type == 'B') {
buy[price] += quant;
} else {
sell[price] += quant;
}
}
std::vector<long> index;
get(sell, 0, 1, index, s);
disp(index, index.size() - 1, -1, sell, 'S');
index.clear();
get(buy, 100001 - 1, -1, index, s);
disp(index, 0, 1, buy, 'B');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
map<long long, long long> b, ss;
for (int i = 0; i < n; i++) {
char np;
long long p, q;
cin >> np >> p >> q;
if (np == 'B') {
b[p] += q;
} else {
ss[p] += q;
}
}
long long k = 0, k1 = 0, pk = 0, pos = int(1e5);
for (int i = 0; pk < s && i <= int(1e5); i++) {
if (ss[i] != 0) {
pk++;
if (pk == s) pos = i;
}
}
for (int i = pos; k < s && i >= 0; i--) {
if (ss[i] != 0) {
k++;
cout << "S " << i << ' ' << ss[i] << '\n';
}
}
for (int i = int(1e5); k1 < s && i >= 0; i--) {
if (b[i] != 0) {
k1++;
cout << "B " << i << ' ' << b[i] << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, s, p1[1000], m1[1000], p2[1000], m2[1000];
cin >> n >> s;
char r;
int cnt1 = 0, cnt2 = 0;
int x, y;
bool f;
for (i = 1; i <= n; i++) {
cin >> r;
f = false;
if (r == 'S') {
cin >> x >> y;
for (j = 1; j <= cnt1; j++) {
if (p1[j] == x) {
m1[j] = m1[j] + y;
f = true;
}
}
if (f == false) {
cnt1++;
p1[cnt1] = x;
m1[cnt1] = y;
}
} else {
cin >> x >> y;
for (j = 1; j <= cnt2; j++) {
if (p2[j] == x) {
m2[j] = m2[j] + y;
f = true;
}
}
if (f == false) {
cnt2++;
p2[cnt2] = x;
m2[cnt2] = y;
}
}
}
int temp1;
for (i = 1; i <= cnt1 - 1; i++) {
for (j = i + 1; j <= cnt1; j++) {
if (p1[i] > p1[j]) {
temp1 = p1[i];
p1[i] = p1[j];
p1[j] = temp1;
temp1 = m1[i];
m1[i] = m1[j];
m1[j] = temp1;
}
}
}
for (i = 1; i <= cnt2 - 1; i++) {
for (j = i + 1; j <= cnt2; j++) {
if (p2[i] < p2[j]) {
temp1 = p2[i];
p2[i] = p2[j];
p2[j] = temp1;
temp1 = m2[i];
m2[i] = m2[j];
m2[j] = temp1;
}
}
}
if (cnt1 > s) cnt1 = s;
for (i = cnt1; i > 0; i--) {
cout << "S " << p1[i] << " " << m1[i] << endl;
}
if (cnt2 >= s) cnt2 = s;
for (i = 1; i <= cnt2; i++) {
cout << "B " << p2[i] << " " << m2[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> ms, mb;
map<int, int>::iterator it;
vector<pair<int, int> > v;
int main() {
int n, s, i, t, p, q, cnt;
cin >> n >> s;
char x;
for (i = 0; i < n; i++) {
cin >> x >> p >> q;
if (x == 'B') mb[p] += q;
if (x == 'S') ms[p] += q;
}
t = mb.size();
t = t < s ? 0 : t - s;
cnt = 0;
for (it = ms.begin(); it != ms.end(); it++) {
v.push_back(make_pair(it->first, it->second));
cnt++;
if (cnt >= s) break;
}
reverse(v.begin(), v.end());
for (i = 0; i < v.size(); i++) {
cout << "S " << v[i].first << " " << v[i].second << endl;
}
v.clear();
cnt = 0;
for (it = mb.begin(); it != mb.end(); it++) {
cnt++;
if (cnt <= t)
continue;
else {
v.push_back(make_pair(it->first, it->second));
}
}
reverse(v.begin(), v.end());
for (i = 0; i < v.size(); i++) {
cout << "B " << v[i].first << " " << v[i].second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
map<int, int> m1;
map<int, int> m2;
for (int i = 0; i < n; i++) {
char k;
cin >> k;
int x, y;
cin >> x >> y;
if (k == 'B') {
m1[x] += y;
} else {
m2[x] += y;
}
}
map<int, int>::iterator it;
map<int, int>::iterator it1;
while (m1.size() > s) {
m1.erase(m1.begin());
}
while (m2.size() > s) {
m2.erase(--m2.end());
}
if (m1.size()) {
it = m1.end();
it--;
}
if (m2.size()) {
it1 = m2.end();
it1--;
}
for (int i = 0; i < s && m2.size(); i++) {
cout << "S " << (*it1).first << " " << (*it1).second << '\n';
if (it1 == m2.begin()) break;
it1--;
}
for (int i = 0; i < s && m1.size(); i++) {
cout << "B " << (*it).first << " " << (*it).second << '\n';
if (it == m1.begin()) break;
it--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > v;
struct node {
string dir;
long long price, vol;
} book[1005], l[1005];
int chk[1002];
bool cmp(node i, node j) { return i.dir > j.dir; }
bool cmp2(node i, node j) {
if (i.dir == "S" && j.dir == "S")
return i.price > j.price;
else if (i.dir == "B" && j.dir == "B")
return i.price > j.price;
else
return i.dir > j.dir;
}
int main() {
int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> book[i].dir >> book[i].price >> book[i].vol;
}
int len = 0;
for (int i = 0; i < n; i++) {
long long sum = book[i].vol;
for (int j = i + 1; j < n; j++) {
if (i == j) continue;
if (book[i].dir == book[j].dir && book[i].price == book[j].price &&
chk[j] == 0) {
sum += book[j].vol;
chk[j] = 1;
}
}
if (chk[i] == 0) {
l[len].dir = book[i].dir;
l[len].price = book[i].price;
l[len].vol = sum;
len++;
}
}
sort(l, l + len, cmp);
sort(l, l + len, cmp2);
int buy = 0, sell = 0;
for (int i = 0; i < len; i++) {
if (l[i].dir == "B") buy++;
if (l[i].dir == "S") sell++;
}
int k = 0, p = 0;
for (int i = 0; i < len; i++) {
if (l[i].dir == "S") {
if (sell <= s)
cout << l[i].dir << " " << l[i].price << " " << l[i].vol << endl;
sell--;
}
if (l[i].dir == "B") {
if (k < s)
cout << l[i].dir << " " << l[i].price << " " << l[i].vol << endl;
k++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1E5 + 10;
int buy[MaxN], sell[MaxN];
vector<int> v;
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
char c;
int kind, val;
cin >> c >> kind >> val;
if (c == 'B')
buy[kind] += val;
else
sell[kind] += val;
}
int cnt = 0;
for (int i = 0; cnt < k && i < MaxN; ++i)
if (sell[i] != 0) {
v.push_back(i);
++cnt;
}
for (int i = v.size() - 1; i >= 0; --i)
cout << 'S' << " " << v[i] << " " << sell[v[i]] << endl;
cnt = 0;
for (int i = MaxN - 1; cnt < k && i >= 0; --i)
if (buy[i] != 0) {
cout << 'B' << " " << i << " " << buy[i] << endl;
++cnt;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int buy[100005], sell[100005];
int main() {
int n, s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
char ch;
int p, q;
cin >> ch >> p >> q;
if (ch == 'B') {
buy[p] += q;
} else
sell[p] += q;
}
vector<pair<int, int> > ss;
for (int i = 0, t = s; i <= 100000 and t; i++) {
if (sell[i]) {
ss.push_back(make_pair(i, sell[i]));
t--;
}
}
for (int i = ss.size() - 1; i >= 0; i--)
cout << "S " << ss[i].first << ' ' << ss[i].second << '\n';
for (int i = 100000, t = s; i >= 0 and t; i--) {
if (buy[i]) {
cout << "B " << i << ' ' << buy[i] << '\n';
t--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> g[10];
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int sum(long long int n) {
int s = 0;
while (n > 0) {
s += n % 10;
n /= 10;
}
return s;
}
int test = 1;
long long int indexlow(long long int ar[], long long int n, long long int t) {
long long int res = 0;
long long int low = 0;
long long int high = n - 1;
long long int mid = 0;
while (low <= high) {
mid = (low + high) / 2;
if (ar[mid] > t) {
high = mid - 1;
} else if (ar[mid] < t) {
low = mid + 1;
} else
high = mid - 1;
}
return low + 1;
}
long long int indexhigh(long long int ar[], long long int n, long long int t) {
long long int res = 0;
long long int low = 0;
long long int high = n - 1;
long long int mid = 0;
while (low <= high) {
mid = (low + high) / 2;
if (ar[mid] > t) {
high = mid - 1;
} else if (ar[mid] <= t) {
low = mid + 1;
}
}
return low + 1;
}
double find_sqrt_step1(long long int x) {
long long int low = 1, high = x;
long long int mid;
double ans;
while (low < high) {
mid = (low + high) / 2;
if (mid * mid == x) {
ans = mid;
break;
} else if (mid * mid < x) {
ans = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
double tem = 0.1;
for (int i = 1; i <= 10; i++) {
while (ans * ans < x) {
ans += tem;
}
ans -= tem;
tem = tem / 10;
}
return ans;
}
double find_sqrt_step2(long long int x) {
double low = 1, high = x, ans, mid, abs = 1e-10;
while (high - low > abs) {
mid = (low + high) / 2;
if (mid * mid > x) {
high = mid;
} else {
low = mid;
}
}
return mid;
}
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.first < b.first;
}
return false;
}
long long int pro(long long int a) {
long long int p = 1;
if (a < 10) return a;
while (a > 0) {
if (a % 10) p *= a % 10;
a /= 10;
}
return pro(p);
}
void pre() {
for (long long int i = 1; i <= 1000000; i++) {
long long int t = pro(i);
g[t].push_back(i);
}
}
int t[10][1000005];
void solve() {
long long int n, k;
cin >> n >> k;
map<long long int, long long int> S;
map<long long int, long long int, greater<long long int>> B;
long long int a, b;
char c;
while (n--) {
cin >> c >> a >> b;
if (c == 'S')
S[a] += b;
else
B[a] += b;
}
long long int i = 1;
long long int p = S.size();
long long int t = min(p, k);
vector<int> vec;
for (auto a : S) {
vec.push_back(a.first);
if (i == t) break;
i++;
}
reverse(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); i++) {
cout << "S"
<< " " << vec[i] << " " << S[vec[i]] << '\n';
}
i = 1;
p = B.size();
t = min(p, k);
for (auto a : B) {
cout << "B"
<< " ";
cout << a.first << " " << a.second << '\n';
if (i == t) break;
i++;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dpp[100001], dps[100001];
int main() {
int n, s;
cin >> n >> s;
vector<pair<int, int> > buy, sell;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
if (c == 'B') {
int p, b;
cin >> p >> b;
dpp[p] += b;
} else {
int p, b;
cin >> p >> b;
dps[p] += b;
}
}
for (int i = 0; i <= 100000; i++) {
if (dpp[i]) buy.push_back({i, dpp[i]});
if (dps[i]) sell.push_back({i, dps[i]});
}
sort(buy.rbegin(), buy.rend());
sort(sell.rbegin(), sell.rend());
for (int i = max(0, (int)sell.size() - s); i < sell.size(); i++) {
cout << "S " << sell[i].first << " " << sell[i].second << "\n";
}
for (int i = 0; i < s; i++) {
if (i >= buy.size()) break;
cout << "B " << buy[i].first << " " << buy[i].second << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
double sqr(double a) { return a * a; }
struct op {
long long p;
long long q;
op(long long a, long long b) {
p = a;
q = b;
}
};
bool cmp(op a, op b) { return (a.p < b.p); }
bool cmp1(op a, op b) { return (a.p > b.p); }
int main() {
long long n, m, s, k, l, r, q, min, max;
cin >> n >> s;
char ch;
bool bb;
vector<op> p, ans, sell, ans2;
for (int i = 0; i < n; i++) {
cin >> ch >> l >> r;
if (ch == 'B') {
p.push_back(op(l, r));
} else {
sell.push_back(op(l, r));
}
}
if (sell.size() != 0) {
sort(sell.begin(), sell.end(), cmp);
ans2.push_back(sell[0]);
l = 0;
for (int i = 1; i < sell.size(); i++)
if (ans2[l].p == sell[i].p) {
ans2[l].q += sell[i].q;
} else {
l++;
ans2.push_back(sell[i]);
}
l++;
l = s;
if (ans2.size() < s) l = ans2.size();
for (int i = l - 1; i >= 0; i--) {
cout << "S " << ans2[i].p << ' ' << ans2[i].q << '\n';
}
}
if (p.size() != 0) {
sort(p.begin(), p.end(), cmp1);
ans.push_back(p[0]);
l = 0;
for (int i = 1; i < p.size(); i++)
if (ans[l].p == p[i].p) {
ans[l].q += p[i].q;
} else {
l++;
ans.push_back(p[i]);
}
l++;
for (int i = 0; (i < s) && (i < ans.size()); i++) {
cout << "B " << ans[i].p << ' ' << ans[i].q << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int b[100005];
int cmp(pair<int, pair<int, int> > x, pair<int, pair<int, int> > y) {
return (x.first) > (y.first);
}
vector<pair<int, pair<int, int> > > vs, vb, fs, fb;
map<int, int> mps, mpb;
int main() {
int n, s;
;
scanf("%d", &n);
scanf("%d", &s);
for (int i = 0; i < n; i++) {
string s;
int p;
int q;
cin >> s;
scanf("%d", &p);
scanf("%d", &q);
if (s == "B") {
vb.push_back({p, {q, 0}});
} else if (s == "S") {
vs.push_back({p, {q, 1}});
}
}
sort(vs.begin(), vs.end());
;
sort(vb.rbegin(), vb.rend());
int l = 0;
for (int i = 0; i < vs.size(); i++) {
mps[vs[i].first] += vs[i].second.first;
}
for (int i = 0; i < vb.size(); i++) {
mpb[vb[i].first] += vb[i].second.first;
}
map<int, int>::iterator it;
while (mps.size() > s) {
it = mps.end();
mps.erase(--it);
}
while (mpb.size() > s) {
it = mpb.begin();
mpb.erase(it);
}
map<int, int>::reverse_iterator i;
for (i = mps.rbegin(); i != mps.rend(); i++) {
cout << "S " << i->first << " " << i->second << endl;
}
for (i = mpb.rbegin(); i != mpb.rend(); i++) {
cout << "B " << i->first << " " << i->second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s;
int main() {
scanf("%d %d", &n, &s);
long long sell[100001];
long long buy[100001];
memset(sell, 0, sizeof(sell));
memset(buy, 0, sizeof(buy));
for (int i = 0; i < n; i++) {
int p;
long long q;
char d;
cin >> d >> p >> q;
if (d == 'B') {
buy[p] += q;
} else {
sell[p] += q;
}
}
int tmp = s;
int i;
for (i = 0; i <= 100000; i++) {
if (sell[i]) {
tmp--;
}
if (!tmp) {
break;
}
}
if (i > 100000) {
i--;
}
for (; i >= 0; i--) {
if (sell[i]) {
printf("S %d %I64d\n", i, sell[i]);
}
}
tmp = s;
for (i = 100000; i >= 0; i--) {
if (buy[i]) {
printf("B %d %I64d\n", i, buy[i]);
tmp--;
}
if (!tmp) {
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int by[100005], sl[100005];
int main() {
int n, m, i, j, p, k, q;
cin >> n >> m;
for (i = 0; i < n; i++) {
char ch;
cin >> ch >> p >> q;
if (ch == 'B')
by[p] += q;
else
sl[p] += q;
}
int bm = m, sm = m;
vector<int> vt;
for (i = 0; i <= 100000; i++) {
if (sl[i] > 0) {
sm--;
vt.push_back(i);
}
if (sm == 0) break;
}
for (i = vt.size() - 1; i >= 0; i--) {
cout << "S " << vt[i] << " " << sl[vt[i]] << "\n";
}
for (i = 100000; i >= 0; i--) {
if (by[i] > 0) {
bm--;
cout << "B " << i << " " << by[i] << "\n";
}
if (bm == 0) break;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, s;
scanf("%d%d", &n, &s);
int i;
int buy[100001];
int sell[100001];
for (i = 0; i < 100001; i++) {
buy[i] = -1;
sell[i] = -1;
}
int nsell = 0;
for (i = 0; i < n; i++) {
getchar();
char d = getchar();
int price, quality;
scanf("%d%d", &price, &quality);
if (d == 'B') {
if (buy[price] == -1) {
buy[price] = 0;
}
buy[price] += quality;
} else if (d == 'S') {
if (sell[price] == -1) {
sell[price] = 0;
nsell++;
}
sell[price] += quality;
} else {
printf("读入数据出现了问题\n");
return 1;
}
}
int count;
if (nsell >= s) {
count = nsell - s;
for (i = 100001 - 1; i >= 0; i--) {
if (sell[i] != -1) {
if (count == 0) {
printf("S %d %d\n", i, sell[i]);
} else {
count--;
}
}
}
} else {
for (i = 100001 - 1; i >= 0; i--) {
if (sell[i] != -1) {
printf("S %d %d\n", i, sell[i]);
}
}
}
count = s;
for (i = 100001 - 1; i >= 0; i--) {
if (buy[i] != -1) {
if (count == 0) break;
count--;
printf("B %d %d\n", i, buy[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 50;
const int INF = 1000000000 * 2 + 100000000;
struct stock {
int p, q, pos;
};
int cmp1(stock A, stock B) { return A.p < B.p; }
int cmp2(stock A, stock B) { return A.p > B.p; }
int main() {
stock S[1050], B[1050];
int n, s;
int LS = 0, LB = 0;
scanf("%d%d", &n, &s);
for (int i = 1; i <= n; i++) {
char s[2];
int price, cnt;
scanf("%s%d%d", &s, &price, &cnt);
if (s[0] == 'S') {
S[++LS].p = price;
S[LS].q = cnt;
} else {
B[++LB].p = price;
B[LB].q = cnt;
}
}
sort(S + 1, S + LS + 1, cmp1);
sort(B + 1, B + LB + 1, cmp2);
int ps = LS, pb = LB;
while (ps) {
int temp = ps;
while (S[temp].p == S[ps].p) temp--;
temp++;
for (int i = temp + 1; i <= ps; i++) {
S[temp].q += S[i].q;
S[i].p = INF;
}
ps = temp - 1;
}
while (pb) {
int temp = pb;
while (B[temp].p == B[pb].p && temp) temp--;
temp++;
for (int i = temp + 1; i <= pb; i++) {
B[temp].q += B[i].q;
B[i].p = -1 * INF;
}
pb = temp - 1;
}
sort(S + 1, S + LS + 1, cmp1);
sort(B + 1, B + LB + 1, cmp2);
for (int i = min(s, LS); i >= 1; i--) {
if (S[i].p == INF) continue;
printf("S %d %d\n", S[i].p, S[i].q);
}
for (int i = 1; i <= min(s, LB); i++) {
if (B[i].p == -INF) continue;
printf("B %d %d\n", B[i].p, B[i].q);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps9 = 1e-9;
const double eps6 = 1e-6;
const int s200 = 200001;
const int s100 = 100001;
const int s1m = 1000001;
const int imod = 1000000007;
const unsigned long long lmod = 307445734561825777LL;
const int inf = 2000000000;
const long double pi = 3.14159265358979;
int min_(int a, int b) { return (a < b) ? a : b; }
int main() {
int n;
int s;
cin >> n >> s;
vector<long long> buy(100010, 0);
vector<long long> sell(100010, 0);
char op;
int p;
int q;
int buy_c = 0;
int sell_c = 0;
for (int i = 0; i < n; i++) {
cin >> op >> p >> q;
if (op == 'B') {
buy[p] += q;
buy_c++;
} else {
sell[p] += q;
sell_c++;
}
}
int count = min_(s, sell_c);
int ptr = 0;
while ((count > 0) && (ptr < 100010)) {
if (sell[ptr] != 0) {
count--;
}
ptr++;
}
ptr--;
count = min_(s, sell_c);
while ((count > 0) && (ptr >= 0)) {
if (sell[ptr] != 0) {
cout << "S " << ptr << ' ' << sell[ptr] << endl;
count--;
}
ptr--;
}
ptr = 100001;
count = min_(s, buy_c);
while ((count > 0) && (ptr >= 0)) {
if (buy[ptr] != 0) {
cout << "B " << ptr << ' ' << buy[ptr] << endl;
count--;
}
ptr--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, s;
cin >> n >> s;
map<long long int, long long int, greater<long long int>> B, S;
long long int j = 0, k = 0;
while (n--) {
char ch;
long long int price, quantity;
cin >> ch >> price >> quantity;
if (ch == 'B') {
B[price] += quantity;
} else {
S[price] += quantity;
}
}
n = s;
while (S.size() > s) {
S.erase(S.begin());
}
for (auto it : S) {
cout << 'S' << ' ';
cout << it.first;
cout << ' ' << it.second << "\n";
}
while (B.size() > s) {
B.erase(--B.end());
}
for (auto it : B) {
cout << 'B' << ' ';
cout << it.first;
cout << ' ' << it.second << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> a, b;
int n, s, p, q;
string str;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> str >> p >> q;
if (str == "B")
b[p] += q;
else if (str == "S")
a[p] += q;
}
map<int, int>::iterator iter;
if (a.size() > 0) {
iter = a.begin();
int m = min((int)a.size(), (int)s);
for (int i = 1; i <= m; i++) iter++;
for (int i = 0; i < s; i++) {
iter--;
printf("S %d %d\n", iter->first, iter->second);
if (iter == a.begin()) break;
}
}
iter = b.end();
for (int i = 0; b.size() > 0 && i < s; i++) {
iter--;
printf("B %d %d\n", iter->first, iter->second);
if (iter == b.begin()) break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sell[110000], buy[110000], n, s, no1[1100], p[1100], k1, k2, no2[1100],
p1[1100], q, pri, id;
int cmp1(int a, int b) { return p[a] > p[b]; }
int cmp2(int a, int b) { return p1[a] < p1[b]; }
char ord[3];
int main() {
while (scanf("%d%d", &n, &s) != EOF) {
memset(sell, 0, sizeof(sell));
memset(buy, 0, sizeof(buy));
memset(p, 0, sizeof(p));
memset(p1, 0, sizeof(p1));
k1 = -1;
k2 = -1;
for (int i = 0; i < n; i++) {
scanf("%s%d%d", ord, &pri, &q);
if (strcmp(ord, "B") == 0) {
if (buy[pri] == 0) {
k1++;
no1[k1] = k1;
p[k1] = pri;
buy[pri] += q;
} else {
buy[pri] += q;
}
} else {
if (sell[pri] == 0) {
k2++;
no2[k2] = k2;
p1[k2] = pri;
sell[pri] += q;
} else {
sell[pri] += q;
}
}
}
sort(no1, no1 + k1 + 1, cmp1);
sort(no2, no2 + k2 + 1, cmp2);
k2 = min(k2 + 1, s);
k1 = min(k1 + 1, s);
for (int i = k2 - 1; i >= 0; i--) {
id = no2[i];
printf("S %d %d\n", p1[id], sell[p1[id]]);
}
for (int i = 0; i < k1; i++) {
id = no1[i];
printf("B %d %d\n", p[id], buy[p[id]]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
int main() {
int n, k, i;
cin >> n >> k;
map<int, int> buy;
map<int, int> sell;
map<int, int>::iterator itr;
char c;
int a, b;
while (n--) {
cin >> c >> a >> b;
if (c == 'B')
buy[a] += b;
else
sell[a] += b;
}
vector<pair<int, int> > vec;
for (itr = sell.begin(); itr != sell.end(); itr++)
vec.push_back(make_pair(itr->first, itr->second));
sort(vec.begin(), vec.end(), sortinrev);
int l = vec.size();
l = min(l, k);
for (i = 0; i < l; i++)
cout << "S " << vec[vec.size() - l + i].first << " "
<< vec[vec.size() - l + i].second << "\n";
vec.clear();
for (itr = buy.begin(); itr != buy.end(); itr++)
vec.push_back(make_pair(itr->first, itr->second));
sort(vec.begin(), vec.end(), sortinrev);
l = vec.size();
l = min(l, k);
for (i = 0; i < l; i++)
cout << "B " << vec[i].first << " " << vec[i].second << "\n";
}
|
#include <bits/stdc++.h>
const double eps = 1e-8;
const int MAXN = (int)1e9 + 5;
using namespace std;
int main(int argc, char const *argv[]) {
int n, s;
cin >> n >> s;
std::map<int, int> sell, buy;
for (int i = 0; i < n; i++) {
char dir[3];
int price, cnt;
cin >> dir >> price >> cnt;
if (dir[0] == 'B')
buy[price] += cnt;
else
sell[price] += cnt;
}
std::vector<pair<int, int> > res;
if (sell.size() < s) {
for (auto i : sell) {
res.push_back({i.first, i.second});
}
} else {
int cnt = s;
for (auto i : sell) {
res.push_back({i.first, i.second});
cnt--;
if (cnt == 0) break;
}
}
for (int i = res.size() - 1; i >= 0; i--) {
printf("S %d %d\n", res[i].first, res[i].second);
}
if (buy.size() < s) {
for (std::map<int, int>::reverse_iterator it = buy.rbegin();
it != buy.rend(); it++) {
printf("%c %d %d\n", 'B', it->first, it->second);
}
} else {
int cnt = s;
for (std::map<int, int>::reverse_iterator it = buy.rbegin(); cnt;
it++, cnt--) {
printf("%c %d %d\n", 'B', it->first, it->second);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long p[100005], q[100005];
char d[100005];
map<long long, long long> m1;
map<long long, long long> m2;
vector<pair<long long, long long>> ans1;
vector<pair<long long, long long>> ans2;
vector<pair<long long, long long>> ans3;
long long buy[100005];
long long sell[100005];
int main() {
long long n, s, i, j, k;
cin >> n >> s;
for (i = 0; i < n; i++) {
cin >> d[i] >> p[i] >> q[i];
if (d[i] == 'B') {
m1[p[i]] += q[i];
} else {
m2[p[i]] += q[i];
}
}
map<long long, long long>::iterator iter;
for (iter = m2.begin(); iter != m2.end(); iter++) {
ans1.push_back(make_pair(iter->first, iter->second));
}
for (iter = m1.begin(); iter != m1.end(); iter++) {
ans2.push_back(make_pair(iter->first, iter->second));
}
vector<pair<long long, long long>>::iterator it;
sort(ans1.begin(), ans1.end());
sort(ans2.begin(), ans2.end());
long long size1 = ans1.size();
long long size2 = ans2.size();
for (i = 0; i < (min(s, size1)); i++) {
ans3.push_back(make_pair(ans1[i].first, ans1[i].second));
}
sort(ans3.begin(), ans3.end());
long long size3 = ans3.size();
for (i = 0; i < (min(s, size3)); i++) {
cout << "S " << ans3[size3 - 1 - i].first << " "
<< ans3[size3 - 1 - i].second << endl;
}
for (i = 0; i < (min(s, size2)); i++) {
cout << "B " << ans2[size2 - 1 - i].first << " "
<< ans2[size2 - 1 - i].second << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, k, m;
const int count = 100001;
double EPS = 1E-9;
long long a[count];
long long b[count];
while (cin >> n >> s) {
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
for (int i = 0; i < n; i++) {
string order;
int p, q;
cin >> order >> p >> q;
if (order == "B") b[p] += q;
if (order == "S") a[p] += q;
}
int t = 0;
vector<long long> buy;
vector<int> qs;
for (int i = 0; t < s && i < count; i++) {
if (a[i] > 0) {
qs.push_back(i);
buy.push_back(a[i]);
t++;
}
}
for (int i = buy.size() - 1; i >= 0; i--) {
printf("S %i %i \n", qs.at(i), buy.at(i));
t++;
}
t = 0;
for (int i = count - 1; t < s && t < n && i >= 0; i--) {
if (b[i] > 0) {
printf("B %i %i \n", i, b[i]);
t++;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T MAX(T a, T b) {
return a > b ? a : b;
}
template <class T>
T MIN(T a, T b) {
return a < b ? a : b;
}
template <class T1>
void deb(T1 p) {
cout << "Debugging: " << p << endl;
}
template <class T1, class T2>
void deb(T1 p, T2 q) {
cout << "Debugging: " << p << "\t" << q << endl;
}
template <class T1, class T2, class T3>
void deb(T1 p, T2 q, T3 r) {
cout << "Debugging: " << p << "\t " << q << "\t " << r << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 p, T2 q, T3 r, T4 s) {
cout << "Debugging: " << p << "\t " << q << "\t " << r << "\t " << s << endl;
}
long long int POOW(int b, int p) {
if (p == 0) return 1;
return b * POOW(b, p - 1);
}
const int xx[] = {0, 0, 1, -1, -1, 1, -1, 1};
const int yy[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int kx[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int ky[] = {1, 2, 2, 1, -1, -2, -2, -1};
vector<pair<int, int> > va, vb;
int main() {
int sell[100005] = {0}, buy[100005] = {0}, n, s, i, j, k, a, b, d;
char c;
scanf("%d", &n);
scanf("%d", &s);
getchar();
for (i = 0; i < n; i++) {
scanf("%c %d %d", &c, &a, &b);
getchar();
if (c == 'S') {
sell[a] += b;
} else {
buy[a] += b;
}
}
for (i = 0; i < 100002; i++) {
if (sell[i]) va.push_back(make_pair(i, sell[i]));
if (buy[i]) vb.push_back(make_pair(i, buy[i]));
}
sort(va.begin(), va.end());
sort(vb.begin(), vb.end());
i = s - 1;
if (i >= va.size()) i = va.size() - 1;
for (j = 0; i >= 0 and j < s; i--, j++)
cout << "S " << va[i].first << " " << va[i].second << endl;
i = vb.size() - s;
for (k = vb.size() - 1, j = 0; k >= i and j < s and k >= 0; k--, j++)
cout << "B " << vb[k].first << " " << vb[k].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, s;
cin >> n >> s;
map<int, int> buy, sell;
for (int i = 0; i < n; i++) {
char d;
int p, q;
cin >> d >> p >> q;
if (d == 'B')
buy[p] += q;
else
sell[p] += q;
}
vector<pair<int, int> > a, b;
int ct = 0;
for (map<int, int>::reverse_iterator it = buy.rbegin(); it != buy.rend();
it++) {
ct++;
a.push_back(make_pair((*it).first, (*it).second));
if (ct == s) break;
}
ct = 0;
for (map<int, int>::iterator it = sell.begin(); it != sell.end(); it++) {
ct++;
b.push_back(make_pair((*it).first, (*it).second));
if (ct == s) break;
}
sort(a.begin(), a.end(), greater<pair<int, int> >());
sort(b.begin(), b.end(), greater<pair<int, int> >());
int sz = b.size();
for (int i = 0; i < sz; i++)
cout << "S"
<< " " << b[i].first << " " << b[i].second << endl;
sz = a.size();
for (int i = 0; i < sz; i++)
cout << "B"
<< " " << a[i].first << " " << a[i].second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct entry {
long long price, quantity;
};
int comp(entry a, entry b) { return a.price < b.price; }
int comp2(entry a, entry b) { return a.price > b.price; }
entry B[1000];
entry S[1000];
entry T[1000];
int main() {
long long n, s;
cin >> n >> s;
char d;
long long p, q;
long long i = 0, j = 0;
for (long long k = 0; k < n; k++) {
cin >> d >> p >> q;
if (d == 'B') {
B[i].price = p;
B[i].quantity = q;
i++;
} else {
S[j].price = p;
S[j].quantity = q;
j++;
}
}
sort(B, B + i, comp2);
sort(S, S + j, comp);
long long m = 0, temp = S[0].quantity;
long long t = 0;
for (long long k = 0; (k < j) && (k < s) && (m <= j - 1); k++) {
while ((m < j - 1) && (S[m].price == S[m + 1].price)) {
m++;
temp += S[m].quantity;
}
T[t].price = S[m].price;
T[t].quantity = temp;
t++;
m++;
temp = S[m].quantity;
}
sort(T, T + t, comp2);
for (long long k = 0; k < t; k++) {
cout << "S " << T[k].price << " " << T[k].quantity << endl;
}
m = 0, temp = B[0].quantity;
for (long long k = 0; (k < i) && (k < s) && (m <= i - 1); k++) {
while ((m < i - 1) && (B[m].price == B[m + 1].price)) {
m++;
temp += B[m].quantity;
}
cout << "B " << B[m].price << " " << temp << endl;
m++;
temp = B[m].quantity;
}
}
|
#include <bits/stdc++.h>
int b[100001], s[100001];
using namespace std;
int main() {
int n, t;
scanf("%d %d", &n, &t);
char c;
int p, q, co = 0;
set<int> st;
for (int i = 0; i < n; i++) {
scanf("%c", &c);
scanf("%d", &p);
scanf("%d", &q);
cin >> c >> p >> q;
if (c == 'B')
b[p] += q;
else
s[p] += q, st.insert(p);
}
int x = st.size();
for (int i = 100000; i >= 0 && co < t; i--)
if (s[i] != 0 && x <= t) {
printf("S %d %d\n", i, s[i]);
co++;
} else if (s[i] != 0)
x--;
co = 0;
for (int i = 100000; i >= 0 && co < t; i--)
if (b[i] != 0) {
printf("B %d %d\n", i, b[i]);
co++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i, count, x, y, min = 0;
char c;
cin >> n >> s;
count = s;
int buy[100001], sell[100001];
memset(buy, 0, sizeof(buy));
memset(sell, 0, sizeof(sell));
for (i = 0; i < n; i++) {
cin >> c;
cin >> x >> y;
if (c == 'B') {
buy[x] += y;
} else
sell[x] += y;
}
for (i = 0; i < 100001; i++) {
if (!count) break;
if (sell[i]) count--, min = i;
}
count = s;
for (i = min; i >= 0; i--) {
if (!count) break;
if ((sell[i])) cout << 'S' << " " << i << " " << sell[i] << endl, count--;
}
count = s;
for (i = 100000; i >= 0; i--) {
if (!count) break;
if ((buy[i])) cout << 'B' << " " << i << " " << buy[i] << endl, count--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i, a[100005] = {0}, b[100005] = {0}, p, q, count = 0;
char c;
scanf("%d%d", &n, &s);
for (i = 0; i < n; i++) {
getchar();
scanf("%c %d %d", &c, &p, &q);
if (c == 'B')
b[p] += q;
else {
if (!a[p]) count++;
a[p] += q;
}
}
n = s;
i = 100000;
while (i >= 0 && s > 0) {
if (a[i] && count <= s) {
printf("S %d %d\n", i, a[i]);
s--;
count--;
} else if (a[i])
count--;
i--;
}
s = n;
i = 100000;
while (i >= 0 && s > 0) {
if (b[i]) {
printf("B %d %d\n", i, b[i]);
s--;
}
i--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, s, p, q;
map<int, int> bm, sm;
char a;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> a >> p >> q;
if (a == 'B') {
bm[p] += q;
} else {
sm[p] += q;
}
}
int c = 0;
int z = sm.size();
int k = z - s;
for (map<int, int>::reverse_iterator it = sm.rbegin(); it != sm.rend();
it++) {
if (k <= 0) cout << "S " << it->first << ' ' << it->second << '\n';
k--;
}
c = 0;
for (map<int, int>::reverse_iterator it = bm.rbegin();
it != bm.rend() && c < s; it++, c++) {
cout << "B " << it->first << ' ' << it->second << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
if (b.first == a.first) {
return (a.second > b.second);
}
return (a.first > b.first);
}
int main() {
int n, i, j, k;
vector<pair<int, int> > s, b;
scanf("%d%d", &n, &k);
char d;
int p, q;
for (i = 0; i < n; i++) {
getchar();
scanf("%c%d%d", &d, &p, &q);
if (d == 'B') {
b.push_back(make_pair(p, q));
} else {
s.push_back(make_pair(p, q));
}
}
sort(s.begin(), s.end());
sort(b.begin(), b.end(), cmp);
vector<pair<int, int> > dh3, dh;
for (i = 0; i < s.size();) {
int Q = s[i].second;
j = i + 1;
while (j < s.size() && s[i].first == s[j].first) {
Q += s[j].second;
j++;
}
dh3.push_back(make_pair(s[i].first, Q));
if (dh3.size() == k) break;
i = j;
}
for (i = 0; i < b.size();) {
int Q = b[i].second;
j = i + 1;
while (j < b.size() && b[i].first == b[j].first) {
Q += b[j].second;
j++;
}
dh.push_back(make_pair(b[i].first, Q));
if (dh.size() == k) break;
i = j;
}
for (i = dh3.size() - 1; i >= 0; i--) {
printf("S %d %d\n", dh3[i].first, dh3[i].second);
}
for (i = 0; i < dh.size(); i++) {
printf("B %d %d\n", dh[i].first, dh[i].second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct ss {
int p, q;
} nodeb[1005], nodes[1005], node[1005], node1[1005];
bool cmp1(ss a, ss b) { return a.p > b.p; }
bool cmp2(ss a, ss b) { return a.p < b.p; }
int main() {
int n, s;
int tot = 0, tot1 = 0;
scanf("%d%d", &n, &s);
getchar();
int cntb = 0, cnts = 0;
for (int i = 0; i < n; i++) {
char ch;
int x, y;
scanf("%c%d%d", &ch, &x, &y);
getchar();
if (ch == 'B') {
nodeb[cntb].p = x;
nodeb[cntb++].q = y;
} else {
nodes[cnts].p = x;
nodes[cnts++].q = y;
}
}
sort(nodeb, nodeb + cntb, cmp1);
sort(nodes, nodes + cnts, cmp2);
int ans = nodes[0].q;
int flag = 0;
for (int i = 0; i < cnts; i++) {
if (nodes[i].p == nodes[i + 1].p && i + 1 < cnts) {
ans += nodes[i + 1].q;
} else {
node1[tot1].p = nodes[i].p, node1[tot1++].q = ans;
ans = nodes[i + 1].q;
flag++;
}
if (flag == s) break;
}
ans = nodeb[0].q;
flag = 0;
for (int i = 0; i < cntb; i++) {
if (nodeb[i].p == nodeb[i + 1].p && i + 1 < cntb) {
ans += nodeb[i + 1].q;
} else {
node[tot].p = nodeb[i].p, node[tot++].q = ans;
ans = nodeb[i + 1].q;
flag++;
}
if (flag == s) break;
}
for (int i = tot1 - 1; i >= 0; i--) {
printf("S %d %d\n", node1[i].p, node1[i].q);
}
for (int i = 0; i < tot; i++) {
printf("B %d %d\n", node[i].p, node[i].q);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double eps = 0.0000001;
int p1 = 63;
int m1 = 1000000009;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void get_h(string &s, vector<int> &h_pref, vector<int> &pow_p, long long p,
int m) {
pow_p[0] = 1;
int n = pow_p.size();
for (int i = 1; i < n; i++) {
pow_p[i] = pow_p[i - 1] * p % m;
}
h_pref[0] = s[0] - 'a' + 1;
for (int i = 1; i < n; i++) {
h_pref[i] = (h_pref[i - 1] + (long long)pow_p[i] * (s[i] - 'a' + 1)) % m;
}
}
struct cell {
char d;
long long p;
long long q;
};
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, s;
cin >> n >> s;
map<int, int> qb;
map<int, int> qs;
for (int i = 0; i < n; i++) {
char d;
int p;
int q;
cin >> d >> p >> q;
if (d == 'B') {
qb[p] += q;
} else {
qs[p] += q;
}
}
vector<cell> ans;
while (qs.size() > s) {
qs.erase(--qs.end());
}
for (auto u = qs.rbegin(); u != qs.rend(); u++) {
ans.push_back(cell{'S', u->first, u->second});
}
while (qb.size() > s) {
qb.erase(qb.begin());
}
for (auto u = qb.rbegin(); u != qb.rend(); u++) {
ans.push_back(cell{'B', u->first, u->second});
}
for (auto &u : ans) {
cout << u.d << ' ' << u.p << ' ' << u.q << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, long long> sell;
map<long long, long long> buy;
map<long long, long long>::iterator it;
long long n, s;
cin >> n >> s;
while (n--) {
char a;
cin >> a;
long long q, u;
cin >> q >> u;
if (a == 'B') {
buy[q] += u;
} else
sell[q] += u;
}
long long w = 0, w2 = 0;
if (sell.size() > 0)
for (it = sell.end(); it != sell.begin(); it--) {
if (it == sell.end()) continue;
long long zeby = sell.size();
if (w >= zeby - s) {
w2++;
cout << "S " << it->first << " " << it->second << endl;
}
w++;
if (w2 == s - 1) break;
}
it = sell.begin();
if (sell.size() > 0) cout << "S " << it->first << " " << it->second << endl;
w = 0;
if (buy.size() > 0)
for (it = buy.end(); it != buy.begin(); it--) {
if (it == buy.end()) continue;
w++;
if (w >= s) {
break;
}
cout << "B " << it->first << " " << it->second << endl;
}
if (buy.size() > 0) cout << "B " << it->first << " " << it->second << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> b, s;
vector<pair<int, int> > b1, s1;
int main() {
ios_base::sync_with_stdio(0);
int n, ss;
cin >> n >> ss;
char com;
int d, p;
for (int i = 0; i < n; ++i) {
cin >> com >> d >> p;
if (com == 'S')
s[d] += p;
else
b[d] += p;
}
for (auto i = b.begin(); i != b.end(); i++)
b1.push_back(make_pair(i->first, i->second));
for (auto i = s.begin(); i != s.end(); i++)
s1.push_back(make_pair(i->first, i->second));
if (ss < s1.size()) {
for (int i = ss - 1; i >= 0; --i) {
cout << "S " << s1[i].first << " " << s1[i].second << "\n";
}
} else {
for (int i = s1.size() - 1; i >= 0; --i) {
cout << "S " << s1[i].first << " " << s1[i].second << "\n";
}
}
if (ss < b1.size()) {
for (int i = b1.size() - 1; i >= b1.size() - ss; --i) {
cout << "B " << b1[i].first << " " << b1[i].second << "\n";
}
} else {
for (int i = b1.size() - 1; i >= 0; --i) {
cout << "B " << b1[i].first << " " << b1[i].second << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct qq {
int cost, num;
};
qq zavsA[110000];
qq zavsB[110000];
int na, nb;
bool compA(qq a, qq b) { return a.cost < b.cost; }
bool compB(qq a, qq b) { return a.cost > b.cost; }
int main() {
int n, s;
cin >> n >> s;
char type;
int _cost;
int val;
for (int i = 0; i < n; i++) {
cin >> type >> _cost >> val;
if (type == 'B') {
if (zavsB[_cost].num == 0) nb++;
zavsB[_cost].num += val;
} else {
if (zavsA[_cost].num == 0) na++;
zavsA[_cost].num += val;
}
}
for (int i = 0; i < 110000; i++)
if (zavsA[i].num == 0)
zavsA[i].cost = 10000000;
else
zavsA[i].cost = i;
for (int i = 0; i < 110000; i++)
if (zavsB[i].num == 0)
zavsB[i].cost = -1;
else
zavsB[i].cost = i;
sort(&zavsA[0], &zavsA[110000], compA);
sort(&zavsB[0], &zavsB[110000], compB);
for (int i = min(na, s) - 1; i >= 0; i--)
cout << "S " << zavsA[i].cost << " " << zavsA[i].num << endl;
for (int i = 0; i < min(nb, s); i++)
cout << "B " << zavsB[i].cost << " " << zavsB[i].num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct _order {
char d;
int p, q;
};
int main() {
int n, s;
cin >> n >> s;
map<int, int> buy;
set<pair<int, int>> buySet;
map<int, int> sold;
set<pair<int, int>> soldSet;
_order order;
for (int i = 0; i < n; i++) {
cin >> order.d >> order.p >> order.q;
if (order.d == 'B')
buy[order.p] += order.q;
else
sold[order.p] += order.q;
}
for (auto iter : buy) buySet.insert({iter.first, iter.second});
for (auto iter : sold) soldSet.insert({iter.first, iter.second});
int buyS = min(s, (int)buySet.size());
int soldS = min(s, (int)soldSet.size());
set<pair<int, int>>::iterator iter;
int j = 0;
if (soldS > 0) {
vector<pair<int, int>> help;
for (iter = soldSet.begin(); j < soldS; iter++) {
help.push_back({(*iter).first, (*iter).second});
j++;
}
for (int i = soldS - 1; i >= 0; i--)
cout << "S " << help[i].first << ' ' << help[i].second << endl;
}
j = 0;
if (buyS > 0)
for (iter = --buySet.end(); j < buyS; iter--) {
cout << "B " << (*iter).first << ' ' << (*iter).second << endl;
j++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int sold[maxn];
int buy[maxn];
stack<int> pp;
int main() {
int i, n;
int s;
cin >> n >> s;
for (i = 0; i < maxn; i++) {
sold[i] = -1;
buy[i] = -1;
}
for (i = 0; i < n; i++) {
char ch;
int p;
int q;
cin >> ch >> p >> q;
if (ch == 'B') {
if (buy[p] == -1) {
buy[p] = q;
} else
buy[p] += q;
} else {
if (sold[p] == -1) {
sold[p] = q;
} else
sold[p] += q;
}
}
int total = 0;
for (i = 0; i < maxn; i++) {
if (sold[i] != -1) {
total++;
pp.push(i);
if (total == s) break;
}
}
while (!pp.empty()) {
cout << "S " << pp.top() << " " << sold[pp.top()] << endl;
pp.pop();
}
total = 0;
for (i = maxn - 1; i >= 0; i--) {
if (buy[i] != -1) {
total++;
cout << "B " << i << " " << buy[i] << endl;
if (total == s) break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> bu, se;
int main() {
int n, s;
cin >> n >> s;
char a;
int b, c;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a == 'B')
bu[b] += c;
else
se[b] += c;
}
vector<pair<int, int> > hi1, hi2;
for (auto x : bu) hi1.push_back({x.first, x.second});
for (auto x : se) hi2.push_back({x.first, x.second});
sort(hi1.begin(), hi1.end(), greater<pair<int, int> >());
sort(hi2.begin(), hi2.end());
int yo1 = hi1.size(), yo2 = hi2.size();
vector<pair<int, int> > vi1, vi2;
for (int i = 0; i < min(yo1, s); i++) vi1.push_back(hi1[i]);
for (int i = 0; i < min(yo2, s); i++) vi2.push_back(hi2[i]);
sort(vi1.begin(), vi1.end(), greater<pair<int, int> >());
sort(vi2.begin(), vi2.end(), greater<pair<int, int> >());
for (int i = 0; i < vi2.size(); i++)
cout << "S " << vi2[i].first << " " << vi2[i].second << '\n';
for (int i = 0; i < vi1.size(); i++)
cout << "B " << vi1[i].first << " " << vi1[i].second << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
scanf("%d %d", &n, &d);
int b[100001];
int s[100001];
bool se[100001];
fill(b, b + 100001, 0);
fill(s, s + 100001, 0);
fill(se, se + 100001, 0);
char x;
int y, z;
while (n--) {
cin >> x >> y >> z;
if (x == 'B') {
b[y] += z;
} else {
s[y] += z;
}
}
int d1, d2;
d1 = d2 = 0;
for (int i = 0; i <= 100000; i++) {
if (s[i] > 0) {
se[i] = 1;
d1++;
if (d1 == d) goto abc;
}
}
abc:
for (int i = 100000; i >= 0; i--) {
if (se[i] == 1) printf("S %d %d\n", i, s[i]);
}
for (int i = 100000; i >= 0; i--) {
if (b[i] > 0) {
printf("B %d %d\n", i, b[i]);
d2++;
if (d2 == d) goto abcd;
}
}
abcd:
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s;
vector<pair<int, int> > B, S;
char c;
int p, q;
int main() {
scanf("%d %d\n", &n, &s);
for (int i = 0; i < n; ++i) {
scanf("%c %d %d\n", &c, &p, &q);
if (c == 'B') {
bool ok = false;
for (int j = 0; j < B.size(); ++j) {
if (B[j].first == p) {
B[j].second += q;
ok = true;
}
}
if (!ok) {
B.push_back(make_pair(p, q));
}
} else {
bool ok = false;
for (int j = 0; j < S.size(); ++j) {
if (S[j].first == p) {
S[j].second += q;
ok = true;
}
}
if (!ok) {
S.push_back(make_pair(p, q));
}
}
}
sort(B.begin(), B.end());
sort(S.begin(), S.end());
int t = S.size();
int tt = B.size();
for (int i = s > t ? t - 1 : s - 1; i >= 0; --i) {
printf("S %d %d\n", S[i].first, S[i].second);
}
for (int i = B.size() - 1; i >= 0 && i >= tt - s; --i) {
printf("B %d %d\n", B[i].first, B[i].second);
}
}
|
#include <bits/stdc++.h>
using namespace ::std;
int main() {
vector<pair<long long int, long long int> > v1, v2;
long long int i, j, k, n, s;
cin >> n >> s;
for (i = 0; i < n; i++) {
long long int a, b;
char c;
cin >> c >> a >> b;
if (c == 'B') {
long long int flag = 0;
for (j = 0; j < v1.size(); j++) {
if (v1[j].first == a) {
v1[j].second += b;
flag = 1;
}
}
if (flag == 0) v1.push_back(make_pair(a, b));
} else {
long long int flag = 0;
for (j = 0; j < v2.size(); j++) {
if (v2[j].first == a) {
v2[j].second += b;
flag = 1;
}
}
if (flag == 0) v2.push_back(make_pair(a, b));
}
}
if (v1.size()) sort(v1.rbegin(), v1.rend());
if (v2.size()) sort(v2.begin(), v2.end());
for (i = (long long int)min(s - 1, (long long int)v2.size() - 1); i >= 0; i--)
cout << "S " << v2[i].first << " " << v2[i].second << endl;
for (i = 0; i < (long long int)min((long long int)v1.size(), s); i++)
cout << "B " << v1[i].first << " " << v1[i].second << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s;
map<int, int> Mb, Ms;
vector<pair<int, int> > vec;
int main() {
while (~scanf("%d%d", &n, &s)) {
Mb.clear(), Ms.clear(), vec.clear();
char ss[3];
int p, q;
for (int i = 1; i <= n; i++) {
scanf("%s%d%d", ss, &p, &q);
if (ss[0] == 'B')
Mb[p] += q;
else if (ss[0] == 'S')
Ms[p] += q;
}
int t = 0;
for (map<int, int>::iterator ri = Ms.begin(); ri != Ms.end(); ri++) {
vec.push_back(make_pair(ri->first, ri->second));
if (++t >= s) break;
}
for (int i = vec.size() - 1; i >= 0; i--)
printf("S %d %d\n", vec[i].first, vec[i].second);
t = 0;
for (map<int, int>::reverse_iterator ri = Mb.rbegin(); ri != Mb.rend();
ri++) {
printf("B %d %d\n", ri->first, ri->second);
if (++t >= s) break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, dep, p, q, cou;
char d;
cin >> n >> dep;
vector<pair<int, int> > s, b, ans;
for (int i = 0; i < n; i++) {
cin >> d;
cin >> p >> q;
if (d == 'B') {
b.push_back(make_pair(p, q));
} else {
s.push_back(make_pair(p, q));
}
}
sort(s.begin(), s.end());
sort(b.rbegin(), b.rend());
cou = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i].first == s[i - 1].first) {
s[i].second += s[i - 1].second;
} else {
ans.push_back(make_pair(s[i - 1].first, s[i - 1].second));
cou++;
if (cou == dep) {
break;
}
}
}
if (cou < dep && s.size()) {
ans.push_back(make_pair(s[s.size() - 1].first, s[s.size() - 1].second));
}
sort(ans.rbegin(), ans.rend());
for (int i = 0; i < ans.size(); i++) {
cout << "S " << ans[i].first << " " << ans[i].second << endl;
}
cou = 0;
for (int i = 1; i < b.size(); i++) {
if (b[i].first == b[i - 1].first) {
b[i].second += b[i - 1].second;
} else {
cout << "B " << b[i - 1].first << " " << b[i - 1].second << endl;
cou++;
if (cou == dep) {
break;
}
}
}
if (cou < dep && b.size()) {
cout << "B " << b[b.size() - 1].first << " " << b[b.size() - 1].second
<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> B;
map<int, int> S;
map<int, int>::iterator it;
int main() {
int a, b, c, d, e;
char s[10];
scanf("%d %d", &a, &b);
for (c = 0; c < a; c++) {
scanf("%s", s);
scanf("%d", &d);
scanf("%d", &e);
if (s[0] == 'B') {
B[d] += e;
}
if (s[0] == 'S') {
S[d] += e;
}
}
if (S.empty() == false) {
for (a = 0, it = S.begin(); it != S.end() && a < b - 1; it++, a++) {
}
if (it == S.end()) {
it--;
}
for (a = 0; a < b; it--, a++) {
printf("S %d %d\n", it->first, it->second);
if (it == S.begin()) {
a = b;
}
}
}
if (B.empty() == false) {
for (a = 0, it = B.end(), it--; a < b; it--, a++) {
printf("B %d %d\n", it->first, it->second);
if (it == B.begin()) {
a = b;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
map<int, int> b, s;
void print(map<int, int>::iterator it, int x) {
if (x >= k || it == s.end()) return;
map<int, int>::iterator a = it;
print(++it, x + 1);
printf("S %d %d\n", a->first, a->second);
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
int p, q;
char c;
cin >> c >> p >> q;
if (c == 'B') {
b[p] += q;
} else {
s[p] += q;
}
}
print(s.begin(), 0);
int i = 0;
map<int, int>::reverse_iterator rt;
for (rt = b.rbegin(); i < k && rt != b.rend(); rt++, i++) {
printf("B %d %d\n", rt->first, rt->second);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
const int INF = 0x7fffffff;
const int MOD = 1000 * 1000 * 1000 + 7;
long long by[MAXN + 17] = {0}, sl[MAXN + 17] = {0};
int main() {
int n, s;
cin >> n >> s;
for (int i = 0; i < n; ++i) {
char cmd;
int p, q;
cin >> cmd >> p >> q;
if (cmd == 'B')
by[p] += q;
else
sl[p] += q;
}
int time = s;
queue<pair<int, int> > q;
for (int i = MAXN + 16; i >= 0; i--) {
if (sl[i] > 0) {
q.push(make_pair(i, sl[i]));
}
}
while (q.size() > s) {
q.pop();
}
while (!q.empty()) {
cout << "S " << q.front().first << " " << q.front().second << endl;
q.pop();
}
time = s;
for (int i = MAXN + 16; i >= 0 && time > 0; i--) {
if (by[i] > 0) {
cout << "B"
<< " " << i << " " << by[i] << endl;
time--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int b, long long int e) {
long long int x = 1;
while (e > 0) {
if (e & 1) x = x * b;
b = b * b;
e = e / 2;
}
return x;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int mult(long long int A, long long int B) {
if (B == 0) return 0;
long long int u = mult(A, B / 2);
long long int res;
if (B % 2 == 0)
res = u + u;
else
res = u + u + A;
while (res >= 1000000007) res -= 1000000007;
return res;
}
long long int t, i, j, k, l, m, n;
map<long long int, long long int> buy;
map<long long int, long long int> sell;
int main() {
char c;
scanf("%lld %lld", &n, &m);
for (i = 0; i < n; i++) {
cin >> c >> j >> k;
if (c == 'B')
buy[j] += k;
else
sell[j] += k;
}
long long int temp = m;
if (!sell.empty()) {
map<long long int, long long int>::iterator it = sell.end();
it--;
long long int sz = sell.size();
if (temp < sz)
while (sz != temp) {
sz--;
it--;
}
for (; it != sell.begin(); it--) {
if (temp == 0) break;
cout << 'S' << " " << it->first << " " << it->second << "\n";
temp--;
}
if (temp != 0) {
it = sell.begin();
cout << 'S' << " " << it->first << " " << it->second << "\n";
}
}
if (!buy.empty()) {
temp = m;
map<long long int, long long int>::iterator it = buy.end();
it--;
for (; it != buy.begin(); it--) {
if (temp == 0) break;
cout << 'B' << " " << it->first << " " << it->second << "\n";
temp--;
}
if (temp != 0) {
it = buy.begin();
cout << 'B' << " " << it->first << " " << it->second << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int q[10001], p[10001];
int q1[100005], p1[100005];
int main() {
int n, j, i, l, s, k;
char a[2];
memset(q1, 0, sizeof(q1));
memset(p1, 0, sizeof(p1));
memset(q, 0, sizeof(q));
memset(p, 0, sizeof(p));
scanf("%d%d", &n, &s);
i = 0;
j = 0;
while (n--) {
scanf("%s %d %d", a, &l, &k);
if (a[0] == 'S') {
q[i++] = l;
q1[l] += k;
} else {
p[j++] = l;
p1[l] += k;
}
}
sort(q, q + i);
sort(p, p + j);
int l1 = 0, l2 = 0;
q[i] = -1;
p[j] = -1;
for (l = 0; l < i; l++)
if (q[l] != q[l + 1]) q[l1++] = q[l];
for (l = 0; l < j; l++)
if (p[l] != p[l + 1]) p[l2++] = p[l];
if (l1 > s)
i = s;
else
i = l1;
for (i--; i >= 0; i--) {
printf("S %d %d\n", q[i], q1[q[i]]);
}
for (l = l2 - 1, i = 0; l >= 0 && i < s; l--, i++) {
printf("B %d %d\n", p[l], p1[p[l]]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int flag[100000 + 5], flag2[100000 + 5], n, m, tmp, pos, p, q;
char word[5];
int main() {
while (~scanf("%d%d", &n, &m)) {
memset(flag, 0, sizeof flag);
memset(flag2, 0, sizeof flag2);
for (int i = 1; i <= n; ++i) {
scanf("%s%d%d", word, &p, &q);
if (word[0] == 'S')
flag[p] += q;
else
flag2[p] += q;
}
tmp = pos = 0;
for (int i = 0; i <= 100000 && tmp < m; ++i)
if (flag[i] > 0) ++tmp, pos = i;
for (int i = pos; i >= 0; --i)
if (flag[i] > 0) printf("S %d %d\n", i, flag[i]);
tmp = 0;
for (int i = 100000; i >= 0 && tmp < m; --i)
if (flag2[i] > 0) {
printf("B %d %d\n", i, flag2[i]);
++tmp;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 100 * 1000 + 10;
int qs[Maxn], qb[Maxn];
vector<int> s;
vector<int> b;
set<int> ss;
set<int> bb;
int main() {
int n, t;
cin >> n >> t;
char c;
int x, y;
for (int i = 0; i < n; i++) {
cin >> c >> x >> y;
if (c == 'S') {
qs[x] += y;
if (!ss.count(x)) {
s.push_back(x);
ss.insert(x);
}
} else if (c == 'B') {
qb[x] += y;
if (!bb.count(x)) {
b.push_back(x);
bb.insert(x);
}
}
}
sort(s.begin(), s.end());
sort(b.begin(), b.end());
for (int j = min(t, (int)s.size()) - 1; j >= 0; j--)
cout << "S"
<< " " << s[j] << " " << qs[s[j]] << endl;
for (int i = 0; i < min(t, (int)b.size()); i++)
cout << "B"
<< " " << b[(int)b.size() - 1 - i] << " "
<< qb[b[(int)b.size() - 1 - i]] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ss[100005];
int bb[100005];
int main() {
ios::sync_with_stdio(false);
int n, s;
cin >> n >> s;
for (int(i) = 0; (i) < (n); (i)++) {
string s1;
cin >> s1;
int a1, b1;
cin >> a1 >> b1;
if (s1 == "B") {
bb[a1] += b1;
} else {
ss[a1] += b1;
}
}
int i = 0;
int cnt = 0;
for (i = 0; i < 100005; i++) {
if (ss[i] > 0) cnt++;
if (cnt == s) break;
}
for (int j = i; j >= 0; j--) {
if (ss[j] > 0) {
cout << "S " << j << " " << ss[j] << endl;
}
}
cnt = 0;
for (i = 100004; i >= 0; i--) {
if (bb[i] > 0) {
cout << "B " << i << " " << bb[i] << endl;
cnt++;
}
if (cnt == s) break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10 + 100000;
int n, s;
int sell[MAXN];
int buy[MAXN];
int main() {
scanf("%d%d\n", &n, &s);
for (int i = 0; i < n; ++i) {
char x;
int u, v;
scanf("%c%d%d\n", &x, &u, &v);
if (x == 'B')
buy[u] += v;
else
sell[u] += v;
}
int cnt = 0, pos = 0;
for (int i = 0; i <= 100000; ++i)
if (sell[i]) {
cnt++;
if (cnt == s) {
pos = i;
break;
}
pos = i;
}
for (int i = pos; i >= 0; --i)
if (sell[i]) printf("S %d %d\n", i, sell[i]);
for (int i = 100000, cnt = 0; cnt < s && i >= 0; --i)
if (buy[i]) {
cnt++;
printf("B %d %d\n", i, buy[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cs[100002], cb[100002];
int main() {
int maxs = 0, maxb = 0, p, q, n, i, j, se;
char d;
scanf("%d", &n);
scanf("%d", &se);
vector<pair<int, int> > v;
pair<int, int> l;
for (i = 0; i <= n - 1; i++) {
scanf(" %c", &d);
if (d == 'S') {
scanf("%d", &p);
scanf("%d", &q);
cs[p] += q;
if (maxs < p) maxs = p;
} else {
scanf("%d", &p);
scanf("%d", &q);
cb[p] += q;
if (maxb < p) maxb = p;
}
}
int e = 0;
for (i = 0; i <= maxs + 1 - 1; i++) {
if (e == se) break;
if (cs[i] > 0) {
l.first = i;
l.second = cs[i];
v.push_back(l);
e++;
}
}
for (j = e - 1; j >= 0; j--) {
printf("S %d %d\n", v[j].first, v[j].second);
}
e = 0;
for (j = maxb; j >= 0; j--) {
if (e == se) break;
if (cb[j] > 0) {
printf("B %d %d\n", j, cb[j]);
e++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, len;
map<int, int> buy, sell;
bool cmp(pair<int, int> l, pair<int, int> r) {
if (l.first != r.first)
return l.first > r.first;
else
return l.second > r.second;
}
bool cmp2(pair<int, pair<int, int> > l, pair<int, pair<int, int> > r) {
if (l.first != r.first) return l.first < r.first;
if (l.second.first != r.second.first) return l.second.first > r.second.first;
return l.second.second < r.second.second;
}
int main() {
int i, j, k, t, a, b;
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
for (i = 0; i < n; i++) {
string u;
cin >> u;
cin >> a >> b;
if (u[0] == 'B') {
buy[a] += b;
} else {
sell[a] += b;
}
}
vector<pair<int, int> > buy2, sell2;
for (auto cur : buy) buy2.push_back(cur);
for (auto cur : sell) sell2.push_back(cur);
sort(buy2.begin(), buy2.end(), cmp);
sort(sell2.begin(), sell2.end());
vector<pair<int, pair<int, int> > > ans;
for (i = 0; i < min(((int)sell2.size()), m); i++) {
ans.push_back(pair<int, pair<int, int> >(0, sell2[i]));
}
for (i = 0; i < min(((int)buy2.size()), m); i++) {
ans.push_back(pair<int, pair<int, int> >(1, buy2[i]));
}
sort(ans.begin(), ans.end(), cmp2);
for (auto cur : ans) {
cout << ((cur.first == 0) ? ("S ") : ("B ")) << cur.second.first << " "
<< cur.second.second << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
c b, e;
};
template <class c>
rge<c> range(c i, c j) {
return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
template <class c>
debug& operator<<(const c&) {
return *this;
}
};
const long long int N = 1e5 + 5;
const long long int INF = 1e18;
long long int mod = 1e9 + 7;
long long int dx[4] = {0, 0, +1, -1};
long long int dy[4] = {+1, -1, 0, 0};
long long int po(long long int a, long long int b) {
a %= mod;
long long int res = 1;
while (b > 0) {
if (b & 1) res = (res % mod * a % mod) % mod;
a = (a % mod * a % mod) % mod;
b >>= 1;
}
return res % mod;
}
map<long long int, long long int> mb, ms;
void solve() {
long long int n, m;
cin >> n >> m;
for (long long int i = 0; i < n; i++) {
char ch;
cin >> ch;
long long int x, y;
cin >> x >> y;
if (ch == 'B') {
mb[x] += y;
} else {
ms[x] += y;
}
}
auto it1 = mb.end();
if ((long long int)mb.size()) it1--;
long long int ct = 0;
long long int nax = min(m, (long long int)mb.size());
vector<pair<long long int, long long int> > vb, vs;
while (ct < nax) {
vb.push_back({it1->first, it1->second});
ct++;
it1--;
}
ct = 0;
auto it2 = ms.begin();
nax = min(m, (long long int)ms.size());
while (ct < nax) {
vs.push_back({it2->first, it2->second});
ct++;
it2++;
}
sort(vs.rbegin(), vs.rend());
sort(vb.rbegin(), vb.rend());
for (auto to : vs) cout << 'S' << " " << to.first << " " << to.second << "\n";
for (auto to : vb) cout << 'B' << " " << to.first << " " << to.second << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cmp(pair<int, int> A, pair<int, int> B) { return A.first > B.first; }
int main() {
int n, m;
cin >> n >> m;
map<long long, long long> S, B;
for (int i = 0; i < n; i++) {
char c;
int p, q;
cin >> c >> p >> q;
if (c == 'S') {
S[p] += q;
} else
B[p] += q;
}
int t = m;
map<long long, long long>::iterator it;
vector<pair<int, int> > X, Y;
for (it = S.begin(); it != S.end(); ++it) {
X.push_back(pair<int, int>(it->first, it->second));
}
t = m;
for (it = B.begin(); it != B.end(); ++it) {
Y.push_back(pair<int, int>(it->first, it->second));
}
sort((X).begin(), (X).end(), cmp);
sort((Y).begin(), (Y).end(), cmp);
for (int i = max(0, (int)X.size() - t); t-- && i < (int)X.size(); i++) {
cout << "S " << X[i].first << " " << X[i].second << "\n";
}
t = m;
for (int i = 0; t-- && i < (int)Y.size(); i++) {
cout << "B " << Y[i].first << " " << Y[i].second << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
bool vis[1001][1001];
int n, m;
bool valid(int i, int j) { return i >= 0 && i < n && j >= 0 && j < m; }
map<int, int> second, B;
int main() {
fast();
int y, z, s;
char x;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> x >> y >> z;
if (x == 'B')
B[y] += z;
else
second[y] += z;
}
int i = ((int)(second.size()));
for (map<int, int>::reverse_iterator it = second.rbegin();
it != second.rend(); it++) {
i--;
if (i >= s) continue;
cout << 'S' << " " << it->first << " " << it->second << "\n";
i--;
}
i = s;
for (map<int, int>::reverse_iterator it = B.rbegin(); it != B.rend(); it++) {
if (i <= 0) break;
cout << 'B' << " " << it->first << " " << it->second << "\n";
i--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> b, s;
int main() {
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
char ch;
int p, v;
cin >> ch >> p >> v;
if (ch == 'B')
b[p] += v;
else
s[p] += v;
}
int cnt = 0;
while (s.size() > x) s.erase(--s.end());
while (b.size() > x) b.erase(b.begin());
map<int, int>::iterator it;
vector<pair<int, int> > bb, ss;
for (it = s.begin(); it != s.end(); it++)
ss.push_back({it->first, it->second});
for (it = b.begin(); it != b.end(); it++)
bb.push_back({it->first, it->second});
reverse(ss.begin(), ss.end());
reverse(bb.begin(), bb.end());
for (int i = 0; i < ss.size(); i++)
cout << "S " << ss[i].first << " " << ss[i].second << '\n';
for (int i = 0; i < bb.size(); i++)
cout << "B " << bb[i].first << " " << bb[i].second << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int n, k, i, a, b, sizes = 0;
char ch;
map<long long int, long long int> ms, mb;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> ch >> a >> b;
if (ch == 'S') {
if (ms[a] == 0) sizes++;
ms[a] = ms[a] + b;
} else {
mb[a] = mb[a] + b;
}
}
string j[sizes];
i = sizes - 1;
for (auto it = ms.rbegin(); it != ms.rend(); it++) {
j[i] = "S " + to_string(it->first) + " " + to_string(it->second);
i--;
}
for (i = k - 1; i >= 0; i--) {
if (i < sizes) {
cout << j[i] << endl;
}
}
i = 0;
for (auto it1 = mb.rbegin(); it1 != mb.rend(); it1++) {
if (i < k) {
cout << "B " << it1->first << " " << it1->second << endl;
} else
break;
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 9, mod = 1e9 + 7, inf = 1e17;
map<long long, int> mp;
set<long long> st;
vector<string> ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, s, p, v;
set<int> sell, buy;
map<int, int> selll, buyy;
cin >> n >> s;
char c;
for (int i = 0; i < n; i++) {
cin >> c >> p >> v;
if (c == 'S') {
selll[p] += v;
sell.insert(p);
} else {
buyy[p] += v;
buy.insert(p * -1);
}
}
int fe = s;
set<int> ans;
for (auto el : sell) {
if (fe)
ans.insert(el * -1);
else
break;
fe--;
}
int f = s;
for (auto el : ans) {
if (f)
cout << "S " << el * -1 << " " << selll[el * -1] << "\n";
else
break;
}
for (auto el : buy) {
if (s)
cout << "B " << el * -1 << " " << buyy[el * -1] << "\n";
else
break;
s--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ns;
vector<pair<char, pair<long long, long long> > > v, b, s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
cin >> n >> ns;
for (int i = 0; i < n; i++) {
char c;
int pi, qi;
cin >> c >> pi >> qi;
v.push_back(make_pair(c, make_pair(pi, qi)));
}
sort(v.begin(), v.end());
for (int i = n - 1; i >= 0; i--) {
if (v[i].first == 'B') {
if (b.size() > 0 && b.back().second.first == v[i].second.first) {
b.back().second.second += v[i].second.second;
} else
b.push_back(make_pair(
v[i].first, make_pair(v[i].second.first, v[i].second.second)));
} else if (v[i].first == 'S') {
if (s.size() > 0 && s.back().second.first == v[i].second.first) {
s.back().second.second += v[i].second.second;
} else
s.push_back(make_pair(
v[i].first, make_pair(v[i].second.first, v[i].second.second)));
}
}
if (s.size() >= ns) {
int u;
u = s.size() - ns;
for (int i = u; i < s.size(); i++)
cout << s[i].first << " " << s[i].second.first << " "
<< s[i].second.second << endl;
} else
for (int i = 0; i < s.size(); i++) {
cout << s[i].first << " " << s[i].second.first << " "
<< s[i].second.second << endl;
}
if (b.size() >= ns)
for (int i = 0; i < ns; i++)
cout << b[i].first << " " << b[i].second.first << " "
<< b[i].second.second << endl;
else
for (int i = 0; i < b.size(); i++) {
cout << b[i].first << " " << b[i].second.first << " "
<< b[i].second.second << endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.