problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03147 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, l;
int i = 0;
cin >> n;
vector<int> table(n + 1);
for (int i = 0; i < n; ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, l;
int i = 0;
cin >> n;
int table[n + 1];
for (int i = 0; i < n; i++) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(x) (x).begin(), (x)... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define ALL(x) (x).begin(), (x)... | replace | 39 | 41 | 39 | 41 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DUMP(a) \
REP(d, a.size()) { ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define R(i, c, n) for (int i = c; i < n; i++)
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DUMP(a) \
REP(d, a.size()) { ... | replace | 42 | 43 | 42 | 43 | 0 | |
p03147 | C++ | Runtime Error | // g++でビルド
#include "bits/stdc++.h"
using namespace std;
vector<int> watering(vector<int> vec, int s) {
while (vec[s] != 0) {
vec[s]--;
s++;
}
return vec;
}
int main() {
int N;
cin >> N;
vector<int> flowers;
int result = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
flowers.... | // g++でビルド
#include "bits/stdc++.h"
using namespace std;
vector<int> watering(vector<int> vec, int s) {
while (vec[s] != 0) {
vec[s]--;
s++;
if (vec.size() == s) {
break;
}
}
return vec;
}
int main() {
int N;
cin >> N;
vector<int> flowers;
int result = 0;
for (int i = 0; i < N... | insert | 10 | 10 | 10 | 13 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n, j) for (int i = n; j <= i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#define mod 1000000007
const int INF = 1e9;
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n, j) for (int i = n; j <= i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#define mod 1000000007
const int INF = 1e9;
ty... | replace | 25 | 26 | 25 | 26 | 0 | |
p03147 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | replace | 38 | 39 | 38 | 39 | TLE | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
auto h = vector<int>(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans = 0;
for (int l = 0; l < n; l++) {
while (h[l] > 0) {
int r = l;
while (h[r] > 0) {
r++;
}
r--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
auto h = vector<int>(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans = 0;
for (int l = 0; l < n; l++) {
while (h[l] > 0) {
int r = l;
while (h[r] > 0) {
r++;
}
r--;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX // 2147483647
#define INFLL LLONG_MAX // 9223372036854775807
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define per(i, n) fo... | insert | 46 | 46 | 46 | 50 | 0 | |
p03147 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
// #define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i,... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 10000000000000009
// #define INF 9223372036854775807
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define ORREP(i, n) for (int i = (n); i >= 1; --i)
#define ZREP(i,... | insert | 43 | 43 | 43 | 44 | TLE | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define numrep(i, n) for (int i = 1; i <= n; i++)
#define bitrep(n) for (int bit = 0; bit < (1 << n); bit++)
#define ll int64_t
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define numrep(i, n) for (int i = 1; i <= n; i++)
#define bitrep(n) for (int bit = 0; bit < (1 << n); bit++)
#define ll int64_t
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
... | replace | 15 | 16 | 15 | 16 | 0 | |
p03147 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
... | replace | 37 | 38 | 37 | 38 | 0 | |
p03147 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int h[200] = {0}, l = 1, cnt = 0;
void mizuyari(int l, int r) {
if (l > r)
return;
for (int i = l; i <= r; i++) {
h[i]--;
}
cnt++;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
while (true) {
for (int i = 0; h[... | #include "bits/stdc++.h"
using namespace std;
int l = 1, cnt = 0;
vector<int> h(300);
void mizuyari(int l, int r) {
if (l > r)
return;
for (int i = l; i <= r; i++) {
h[i]--;
}
cnt++;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
while (true) {
for (int i =... | replace | 3 | 4 | 3 | 5 | 0 | |
p03147 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> line(N);
for (int i = 0; i < N; i++)
cin >> line[i];
int i = 0;
int ans = 0;
while (1) {
if (i == N - 1 && line[i] == 0)
break;
if (line[i] == 0) {
i++;
continue;
}
ans++;
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> line(N);
for (int i = 0; i < N; i++)
cin >> line[i];
int i = 0;
int ans = 0;
while (1) {
if (i == N - 1 && line[i] == 0)
break;
if (line[i] == 0) {
i++;
continue;
}
ans++;
in... | insert | 26 | 26 | 26 | 28 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, j, n) for (int i = (j); i < (int)(n); ++i)
#define lpd(i, j, n) for (int i = (j... | #include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (int)(n); ++i)
#define lpi(i, j, n) for (int i = (j); i < (int)(n); ++i)
#define lpd(i, j, n) for (int i = (j... | replace | 54 | 55 | 54 | 55 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<pair<ll, ll>> vec;
for (int i = 1; i <= N; i++) {
int a, b;
cin >> a >> b;
vec.push_back(make_pair(b, a));
}
sort(vec.begin(), vec.end(), greater<pair<ll, ll>>());
priority_queue<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<pair<ll, ll>> vec;
for (int i = 1; i <= N; i++) {
int a, b;
cin >> a >> b;
vec.push_back(make_pair(b, a));
}
sort(vec.begin(), vec.end(), greater<pair<ll, ll>>());
priority_queue<... | replace | 28 | 29 | 28 | 29 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
const long long int mod = 1000000007, INF = 50000000000000;
t... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
const long long int mod = 1000000007, INF = 50000000000000;
t... | replace | 42 | 43 | 42 | 43 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | replace | 63 | 64 | 63 | 64 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int... | replace | 66 | 67 | 66 | 67 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >>... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >>... | delete | 32 | 40 | 32 | 32 | TLE | |
p03148 | C++ | Runtime Error | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#... | insert | 139 | 139 | 139 | 141 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).beg... | replace | 202 | 203 | 202 | 203 | 0 | |
p03148 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
int main() {
int n, k;
cin >> n >> k;
vector<... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
int main() {
int n, k;
cin >> n >> k;
vector<... | insert | 40 | 40 | 40 | 44 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
u... | replace | 45 | 46 | 45 | 46 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%... | insert | 44 | 44 | 44 | 46 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int MOOD = 998244353;
typedef long long ll;
#define PI 3.14159265359
using namespace std;
boo... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int MOOD = 998244353;
typedef long long ll;
#define PI 3.14159265359
using namespace std;
boo... | insert | 82 | 82 | 82 | 86 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <tu... | replace | 53 | 54 | 53 | 54 | 0 | |
p03148 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = ... | insert | 51 | 51 | 51 | 53 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | replace | 79 | 80 | 79 | 80 | 0 | |
p03148 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | replace | 89 | 90 | 89 | 90 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> d_t;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
d_t.push_back(make_pair(d, t));
}
sort(d_t.begin(), d_t.end(), greater<pair<int, int>>());
vector<long long> ans(1, 0);
map... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> d_t;
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
d_t.push_back(make_pair(d, t));
}
sort(d_t.begin(), d_t.end(), greater<pair<int, int>>());
vector<long long> ans(1, 0);
map... | replace | 29 | 30 | 29 | 33 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm> // minmax, sort, swap
#include <cmath>
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#include <iostream> // cin, cout, cerr
#include <map> // key-value pairs sorted by keys
#... | #include <algorithm> // minmax, sort, swap
#include <cmath>
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#include <iostream> // cin, cout, cerr
#include <map> // key-value pairs sorted by keys
#... | replace | 53 | 54 | 53 | 56 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
#define FOR(i, N) for (i = 0; i < N; i++)
int N, K;
vector<P> t;
bool pairCompareFirst(const P &firstElof, const P &secondElof) {
return firstElof.first > secondElof.first;
}
bool pairCompareSecond(const P &firstElof, const... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
#define FOR(i, N) for (i = 0; i < N; i++)
int N, K;
vector<P> t;
bool pairCompareFirst(const P &firstElof, const P &secondElof) {
return firstElof.first > secondElof.first;
}
bool pairCompareSecond(const P &firstElof, const... | replace | 46 | 47 | 46 | 47 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct Node {
int t, d;
Node() {}
Node(int _t, int _d) : t(_t), d(_d) {}
bool operator<(const Node &_r) const { return d > _r.d; }
};
void solve() {
int n, k;
cin >> n >> k;
vector<Node> a(n);
for (auto &p : a) {
cin >> p.t >> p.d;
p.t--;
}
so... | #include <bits/stdc++.h>
using namespace std;
struct Node {
int t, d;
Node() {}
Node(int _t, int _d) : t(_t), d(_d) {}
bool operator<(const Node &_r) const { return d > _r.d; }
};
void solve() {
int n, k;
cin >> n >> k;
vector<Node> a(n);
for (auto &p : a) {
cin >> p.t >> p.d;
p.t--;
}
so... | replace | 20 | 21 | 20 | 21 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n, k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n, k;
cin >> n ... | insert | 47 | 47 | 47 | 49 | 0 | |
p03148 | Python | Runtime Error | n, k = map(int, input().split())
td = sorted(
[list(map(int, input().split())) for i in range(n)],
reverse=True,
key=lambda x: x[1],
)
type = set()
L = []
Sum = 0
for x in td[:k]:
Sum += x[1]
if x[0] not in type:
type.add(x[0])
else:
L.append(x[1])
L = L[::-1]
type_cnt = len(ty... | n, k = map(int, input().split())
td = sorted(
[list(map(int, input().split())) for i in range(n)],
reverse=True,
key=lambda x: x[1],
)
type = set()
L = []
Sum = 0
for x in td[:k]:
Sum += x[1]
if x[0] not in type:
type.add(x[0])
else:
L.append(x[1])
L = L[::-1]
type_cnt = len(ty... | insert | 21 | 21 | 21 | 23 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K, std::vector<long long> t,
std::vector<long long> d) {
vector<pair<long long, long long>> vs;
for (int i = 0; i < K; i++) {
vs.push_back({d[i], t[i]});
}
sort(vs.rbegin(), vs.rend());
for (int i = 0; i < vs.size... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K, std::vector<long long> t,
std::vector<long long> d) {
vector<pair<long long, long long>> vs;
for (int i = 0; i < N; i++) {
vs.push_back({d[i], t[i]});
}
sort(vs.rbegin(), vs.rend());
for (int i = 0; i < vs.size... | replace | 7 | 8 | 7 | 8 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<pair... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<pair... | insert | 30 | 30 | 30 | 32 | TLE | |
p03148 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool checked[100001];
bool selected[100001];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, k, a, b;
long long int res = 0;
int x, y;
vector<pair<long long int, long long int>> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
bool checked[100001];
bool selected[100001];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, k, a, b;
long long int res = 0;
int x, y;
vector<pair<long long int, long long int>> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
... | insert | 105 | 105 | 105 | 108 | TLE | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> v[n];
rep(i, 0, n) {
int a, d;
cin >> a >> d;
v[a - 1].push_back(d);
}
rep(i, 0, n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, m, n) for (int i = m; i < n; i++)
ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> v[n];
rep(i, 0, n) {
int a, d;
cin >> a >> d;
v[a - 1].push_back(d);
}
rep(i, 0, n) ... | insert | 37 | 37 | 37 | 42 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main() {
ll n, k;
cin >> n >> k;
ve<P> dt(n);
ve<ll> fl(n, 0);
rep(i, n) {
cin >> dt[i].second >> dt[i].first;
dt[i].second--;
}
sor... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main() {
ll n, k;
cin >> n >> k;
ve<P> dt(n);
ve<ll> fl(n, 0);
rep(i, n) {
cin >> dt[i].second >> dt[i].first;
dt[i].second--;
}
sor... | replace | 32 | 33 | 32 | 33 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> sushi(N);
for (int i = 0; i < N; ++i) {
int t, d;
cin >> t >> d;
--t;
sushi[i].first = d;
sushi[i].second = t;
}
sort(sushi.begi... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> sushi(N);
for (int i = 0; i < N; ++i) {
int t, d;
cin >> t >> d;
--t;
sushi[i].first = d;
sushi[i].second = t;
}
sort(sushi.begi... | replace | 34 | 35 | 34 | 35 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
using namespace std;
int used[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> sus;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
sus.pb(mp(y, x));
}
so... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
using namespace std;
int used[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> sus;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
sus.pb(mp(y, x));
}
so... | replace | 34 | 35 | 34 | 35 | 0 | |
p03148 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
typedef pair<ll... | insert | 66 | 66 | 66 | 68 | TLE | |
p03148 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;
int u, p, d, n, tc, q, k, cnt;
char s[N];
ll ans;
vector<int> topping[N];
pair<int, int> a[N];
multiset<int> m, kind;
vector<pair<int, int>> v;
int main() {
// freopen("test.txt","r",stdin);
scanf("%d %d", &n, &k);... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef long long ll;
int u, p, d, n, tc, q, k, cnt;
char s[N];
ll ans;
vector<int> topping[N];
pair<int, int> a[N];
multiset<int> m, kind;
vector<pair<int, int>> v;
int main() {
// freopen("test.txt","r",stdin);
scanf("%d %d", &n, &k);... | insert | 45 | 45 | 45 | 47 | TLE | |
p03148 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int t[100005];
ll d[100005];
vector<pair<ll, int>> vec;
int mp[100005];
struct sushi {
int ti;
ll di;
bool operator>(const sushi &n) con... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int t[100005];
ll d[100005];
vector<pair<ll, int>> vec;
int mp[100005];
struct sushi {
int ti;
ll di;
bool operator>(const sushi &n) con... | replace | 65 | 66 | 65 | 66 | TLE | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<vector<ll>> v(N + 1);
ll sum = 0;
for (int i = 0; i < N; ++i) {
int t;
ll d;
cin >> t >> d;
v[t].push_back(d);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<vector<ll>> v(N + 1);
ll sum = 0;
for (int i = 0; i < N; ++i) {
int t;
ll d;
cin >> t >> d;
v[t].push_back(d);
... | insert | 45 | 45 | 45 | 49 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | replace | 125 | 126 | 125 | 126 | TLE | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip> // << fixed << precision(10)
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(s) cout << s << "\n"
#define SOR... | #include <algorithm>
#include <cmath>
#include <iomanip> // << fixed << precision(10)
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(s) cout << s << "\n"
#define SOR... | insert | 72 | 72 | 72 | 75 | 0 | |
p03148 | Python | Runtime Error | n, k = map(int, input().split())
td = list(
sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda td: -td[1])
)
td2 = []
eaten = set()
dup = 0
score = k * k
i = 0
j = 0
while len(eaten) + dup < k:
if td[i][0] in eaten:
td2.append(td[i])
i += 1
else:
diff = (k - dup)... | n, k = map(int, input().split())
td = list(
sorted([tuple(map(int, input().split())) for _ in range(n)], key=lambda td: -td[1])
)
td2 = []
eaten = set()
dup = 0
score = k * k
i = 0
j = 0
while len(eaten) + dup < k:
if i < n and td[i][0] in eaten:
td2.append(td[i])
i += 1
else:
diff =... | replace | 11 | 12 | 11 | 12 | 0 | |
p03148 | C++ | Runtime Error | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long long MOD = 1000000007;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define r... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long long MOD = 1000000007;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define r... | insert | 228 | 228 | 228 | 230 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 10010;
struct node {
ll v, x;
} a[M];
ll vis[M];
bool cmp(node x, node y) { return x.v > y.v; }
int n, k;
ll cnt, tp, res, ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int a1, b;
cin >> a1 >> b;
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 100010;
struct node {
ll v, x;
} a[M];
ll vis[M];
bool cmp(node x, node y) { return x.v > y.v; }
int n, k;
ll cnt, tp, res, ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int a1, b;
cin >> a1 >> b;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cinttypes>
using namespace std;
using ll = long long;
const int NMAX = 100010;
int used[NMAX];
pair<int, int> dt[NMAX];
ll f[NMAX];
int main() {
ios::sync_with_stdio(false);
int N, K;
scanf("%d %d", &N, &K);
// vector<pair<int, int>> dt(N);
// vector<int> used(N+1, 0);
... | #include <bits/stdc++.h>
#include <cinttypes>
using namespace std;
using ll = long long;
const int NMAX = 100010;
int used[NMAX];
pair<int, int> dt[NMAX];
ll f[NMAX];
int main() {
ios::sync_with_stdio(false);
int N, K;
scanf("%d %d", &N, &K);
// vector<pair<int, int>> dt(N);
// vector<int> used(N+1, 0);
... | replace | 44 | 45 | 44 | 45 | TLE | |
p03148 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<P> vpl;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(... | replace | 50 | 51 | 50 | 51 | TLE | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using P = pair<ll, ll>;
template <typename T> vector<T> cumulative_sum(vector<T> &v) {
vector<T> sum(v.size() + 1);
rep(i, v.size()) { sum[i + 1] = sum[i] + v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
using P = pair<ll, ll>;
template <typename T> vector<T> cumulative_sum(vector<T> &v) {
vector<T> sum(v.size() + 1);
rep(i, v.size()) { sum[i + 1] = sum[i] + v... | insert | 40 | 40 | 40 | 42 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N, K;
cin >> N >> K;
vector<array<ll, 2>> td(N);
for (int i = 0; i < N; i++) {
cin >> td[i][1] >> td[i][0];
}
sort(td.begin(), td.end(), greater<array<ll, 2>>());
ll res = 0;
ll vsu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N, K;
cin >> N >> K;
vector<array<ll, 2>> td(N);
for (int i = 0; i < N; i++) {
cin >> td[i][1] >> td[i][0];
}
sort(td.begin(), td.end(), greater<array<ll, 2>>());
ll res = 0;
ll vsu... | insert | 37 | 37 | 37 | 39 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define EPS (1e-20)
#define MOD (int)(1e9 + 7)
#def... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define EPS (1e-20)
#define MOD (int)(1e9 + 7)
#def... | insert | 90 | 90 | 90 | 92 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace ... | replace | 39 | 42 | 39 | 40 | TLE | |
p03148 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | insert | 55 | 55 | 55 | 56 | TLE | |
p03148 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | insert | 48 | 48 | 48 | 50 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <stack>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, ans, now = 0, cnt = 0;
scanf("%lld%lld", &n, &k);
pair<ll, ll> s[n];
bool f[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &s[i].seco... | #include <algorithm>
#include <functional>
#include <stack>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, ans, now = 0, cnt = 0;
scanf("%lld%lld", &n, &k);
pair<ll, ll> s[n];
bool f[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &s[i].seco... | replace | 26 | 27 | 26 | 27 | 0 | |
p03148 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
template <class T, class U> constexpr bool chmin(T &a, const U b) {
if (a <= b)
return false;
a = b;
r... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
template <class T, class U> constexpr bool chmin(T &a, const U b) {
if (a <= b)
return false;
a = b;
r... | replace | 90 | 91 | 90 | 91 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | replace | 80 | 81 | 80 | 82 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vector<ll> a[100001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, n;
cin >> n >> k;
for (int i = 0;... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vector<ll> a[100001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k, n;
cin >> n >> k;
for (int i = 0;... | replace | 42 | 43 | 42 | 43 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int MAXN = 1e5 + 10;
int k, n;
P sushi[MAXN];
vector<int> removable;
vector<ll> v[MAXN];
vector<ll> sumV;
void solve() {
sort(sushi, sushi + n, greater<P>());
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
const int MAXN = 1e5 + 10;
int k, n;
P sushi[MAXN];
vector<int> removable;
vector<ll> v[MAXN];
vector<ll> sumV;
void solve() {
sort(sushi, sushi + n, greater<P>());
... | replace | 30 | 31 | 30 | 31 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int main() {
int64_t N, K, t, d;
cin >> N >> K;
vector<priority_queue<int64_t>> vpq(MAXN);
for (int i = 0; i < N; i++) {
cin >> t >> d;
vpq[t].push(d);
}
priority_queue<pair<int64_t, int64_t>> pq;
for (int i = 0; i < MAXN; i++... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int main() {
int64_t N, K, t, d;
cin >> N >> K;
vector<priority_queue<int64_t>> vpq(MAXN);
for (int i = 0; i < N; i++) {
cin >> t >> d;
vpq[t].push(d);
}
priority_queue<pair<int64_t, int64_t>> pq;
for (int i = 0; i < MAXN; i++... | insert | 38 | 38 | 38 | 42 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end... | insert | 67 | 67 | 67 | 69 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | #include <bits/stdc++.h>
#ifdef DEBUG
#define PRINT(x) \
cout << "func " << __func__ << ": line " << __LINE__ << ": " << #x << " = " \
<< (x) << endl;
#define PRINTA(a, first, last) \
cout << "func... | insert | 84 | 84 | 84 | 87 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
template <class T, class U> void assign(V<T> &v, int n, const U &a) {
v.assign(n, a);
}
... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
template <class T, class U> void assign(V<T> &v, int n, const U &a) {
v.assign(n, a);
}
... | replace | 47 | 48 | 47 | 48 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) ... | delete | 52 | 53 | 52 | 52 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define MAX_N (100010)
int main() {
int N, K;
scanf("%d%d", &... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define MAX_N (100010)
int main() {
int N, K;
scanf("%d%d", &... | replace | 40 | 41 | 40 | 41 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | insert | 77 | 77 | 77 | 80 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | replace | 90 | 91 | 90 | 91 | 0 | |
p03148 | C++ | Runtime Error |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
int n, k;
long long an... |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 100002;
int n, k;
long long an... | replace | 60 | 61 | 60 | 61 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int n, k;
vector<pair<ll, int>> td;
map<int, int> mp;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
pque;
vector<ll> ans;
int main(void) {
/... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int n, k;
vector<pair<ll, int>> td;
map<int, int> mp;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
pque;
vector<ll> ans;
int main(void) {
/... | replace | 47 | 48 | 47 | 48 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#defi... | replace | 65 | 74 | 65 | 75 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long long... | replace | 56 | 57 | 56 | 61 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz(x) (int)x.size()
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<pair<int, int>> td(n);
for (int i = 0; i < n; i++) {
cin >> td[i].second >> td[i].first;
}
sort(td.rbegin(), td.rend());
//~ for (int i = 0; i < n;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz(x) (int)x.size()
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<pair<int, int>> td(n);
for (int i = 0; i < n; i++) {
cin >> td[i].second >> td[i].first;
}
sort(td.rbegin(), td.rend());
//~ for (int i = 0; i < n;... | replace | 38 | 39 | 38 | 39 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
// typedef pair<ll, P> T;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define re... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
// typedef pair<ll, P> T;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define re... | insert | 118 | 118 | 118 | 120 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
priority_queue<ll, vector<ll>, greater<ll>> que;
vector<P> vec;
ll n, k, t, d, sum, shu, a[100010], ans;
bool jud[100010];
int main(void) {
// Your code here!
cin >> n >> k;... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
priority_queue<ll, vector<ll>, greater<ll>> que;
vector<P> vec;
ll n, k, t, d, sum, shu, a[100010], ans;
bool jud[100010];
int main(void) {
// Your code here!
cin >> n >> k;... | insert | 33 | 33 | 33 | 35 | 0 | |
p03148 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
//---
template <typename T> inline void print(const T &rhs) {
std::cout << " = " << rhs << std::endl;
}
template <typename T> inline void print(const std::vector<T> &rhs) {
... | replace | 107 | 109 | 107 | 109 | 0 | |
p03148 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll... | insert | 68 | 68 | 68 | 70 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, k, t, d;
cin >> n >> k;
vector<pair<ll, ll>> A, B, C;
int var[200001] = {0};
rep(i, n) cin >> t >> d, A.push_back(make_pair(d, t));
sort(A.begin(), A.end(), greater<pair<ll, l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll n, k, t, d;
cin >> n >> k;
vector<pair<ll, ll>> A, B, C;
int var[200001] = {0};
rep(i, n) cin >> t >> d, A.push_back(make_pair(d, t));
sort(A.begin(), A.end(), greater<pair<ll, l... | replace | 26 | 28 | 26 | 28 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | replace | 21 | 22 | 21 | 23 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j) for (int i = 0; i < (int)(j); i++)
#define repeat(i, j, k) for (int i = (j); i < (int)(k); i++)
#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " : " << x << endl
template <class T> bool ... | replace | 77 | 80 | 77 | 80 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
map<int, vector<ll>> sushi;
for (int i = 0; i < n; ++i) {
int t;
ll d;
cin >> t >> d;
sushi[t].push_back(d);
}
vector<ll> g1, g2;
for (auto &p : sushi) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n, k;
cin >> n >> k;
map<int, vector<ll>> sushi;
for (int i = 0; i < n; ++i) {
int t;
ll d;
cin >> t >> d;
sushi[t].push_back(d);
}
vector<ll> g1, g2;
for (auto &p : sushi) ... | insert | 37 | 37 | 37 | 41 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class... T> using TP = tuple<T...>;
using ll = long long;
using ull = unsigned long long;
us... | replace | 1,412 | 1,413 | 1,412 | 1,413 | 0 | |
p03148 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> in(n);
for (int i = 0; i < n; i++) {
cin >> in[i].first >> in[i].second;
in[i].first--;
}
sort(in.begin(), in.end());
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<pair<int, int>> in(n);
for (int i = 0; i < n; i++) {
cin >> in[i].first >> in[i].second;
in[i].first--;
}
sort(in.begin(), in.end());
... | replace | 46 | 47 | 46 | 47 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long> vl;
ll solve(int N, int K, vi &t, vi &d) {
map<int, vi> sushi_list;
for (int i = 0; i < N; i++) {
sushi_list[t[i]].push_back(d[i]);
}
vi winner, looser;
for (auto p : sushi_list) {
vi q ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long> vl;
ll solve(int N, int K, vi &t, vi &d) {
map<int, vi> sushi_list;
for (int i = 0; i < N; i++) {
sushi_list[t[i]].push_back(d[i]);
}
vi winner, looser;
for (auto p : sushi_list) {
vi q ... | replace | 46 | 47 | 46 | 47 | 0 | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
map<int, vll> sushi_list;
for (int i = 0; i < N; ++i) {
int t;
cin >> t;
ll d;
cin >> d;
sushi_list[t].push_back(d);
}
vll winner, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
int main() {
int N, K;
cin >> N >> K;
map<int, vll> sushi_list;
for (int i = 0; i < N; ++i) {
int t;
cin >> t;
ll d;
cin >> d;
sushi_list[t].push_back(d);
}
vll winner, ... | replace | 50 | 52 | 50 | 54 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | insert | 60 | 60 | 60 | 63 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | replace | 129 | 130 | 129 | 130 | 0 | |
p03148 | C++ | Runtime Error | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <... | insert | 101 | 101 | 101 | 103 | 0 | |
p03148 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i ... | replace | 43 | 44 | 43 | 44 | 0 | |
p03148 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<pair<ll, ll>> x(n);
vector<bool> b(n, false);
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
x[i].first = d;
x[i].second = t;
}
sort(x.begin(), x.end());
rever... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<pair<ll, ll>> x(n);
vector<bool> b(n, false);
for (int i = 0; i < n; i++) {
ll t, d;
cin >> t >> d;
x[i].first = d;
x[i].second = t;
}
sort(x.begin(), x.end());
rever... | delete | 45 | 46 | 45 | 45 | TLE | |
p03148 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | insert | 70 | 70 | 70 | 74 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | replace | 51 | 53 | 51 | 54 | -11 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
c... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
c... | insert | 44 | 44 | 44 | 46 | 0 | |
p03148 | C++ | Time Limit Exceeded | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 93 | 94 | 93 | 94 | TLE | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll ... | replace | 114 | 115 | 114 | 115 | 0 | |
p03148 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | replace | 37 | 38 | 37 | 38 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.