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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1LL << 60
long long chose2(long long x) { return x * (x - 1) / 2; }
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N, 0);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<int>());
for (long... | #include <bits/stdc++.h>
using namespace std;
#define INF 1LL << 60
long long chose2(long long x) { return x * (x - 1) / 2; }
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N, 0);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<int>());
K = min(K... | insert | 15 | 15 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define el endl
#define INF 1e8
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end(), greater<int>... | replace | 17 | 18 | 17 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (ll i = 0; i < K; i++) {
H[i] = 0;
}
ll ans = 0;
for (ll i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> H(N);
for (ll i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
if (N <= K) {
cout << 0 << endl;
exit(0);
}
for (ll i = 0; i < K; ... | insert | 13 | 13 | 13 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
ll sum = 0;
rep(i, n) {
cin >> a[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
ll sum = 0;
rep(i, n) {
cin >> a[i];
... | replace | 20 | 21 | 20 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define REP(i, n) for (int i(0); i < n; ++i)
#define REQ(i, a, b) for (int i(a); i <= b; ++i)
int32_t main() {
int n, k;
cin >> n >> k;
int array[n];
REP(i, n) cin >> array[i];
sort(array, array + n, greater<int>());
REP(i, k) array[i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define REP(i, n) for (int i(0); i < n; ++i)
#define REQ(i, a, b) for (int i(a); i <= b; ++i)
int32_t main() {
int n, k;
cin >> n >> k;
int array[n];
REP(i, n) cin >> array[i];
sort(array, array + n, greater<int>());
if (k >= n)
c... | replace | 13 | 17 | 13 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <... | insert | 91 | 91 | 91 | 96 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int _I() {
int x;
scanf("%d", &x);
return x;
}
int mp[10005];
int ar[100005];
void solve() {
int n = _I();
int k = _I();
long long sum = 0;
for (int i = 0; i < n; i++) {
ar[i] = _I();
}
sort(ar, ar + n);
for (int i = 0; i < max(0, n - k); i++) {
... | #include <bits/stdc++.h>
using namespace std;
int _I() {
int x;
scanf("%d", &x);
return x;
}
int mp[10005];
int ar[200005];
void solve() {
int n = _I();
int k = _I();
long long sum = 0;
for (int i = 0; i < n; i++) {
ar[i] = _I();
}
sort(ar, ar + n);
for (int i = 0; i < max(0, n - k); i++) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i, a)
#define rep1(i, a) rep2(i, 0, a)
#define rep2(i, b, a) for (int i = (b); i < ((int)(a)); i++)
#define rep3(i, b, a... | replace | 49 | 50 | 49 | 50 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
typedef pair<int, int> PII;
typedef map<int, int> MII;
const int SZ = 112345;
const int MOD = 1e9 + 7;
int n, k, a[SZ];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
so... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
typedef pair<int, int> PII;
typedef map<int, int> MII;
const int SZ = 212345;
const int MOD = 1e9 + 7;
int n, k, a[SZ];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
so... | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) cin >> H[i];
sort(H.begin(), H.end());
rev... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<ll> H(n);
rep(i, n) cin >> H[i];
sort(H.begin(), H.end());
ll ... | replace | 14 | 18 | 14 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reprep(i, j, h, w) rep(i, h) rep(j, w)
#define rrep(i, m, n) for (int i = m; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define aall(x, n) (x).begin(), (x).begin() ... | replace | 37 | 38 | 37 | 38 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, K, hp;
long long ans = 0;
cin >> N >> K;
vector<int> v;
for (int i = 0; i < N; i++) {
cin >> hp;
v.push_back(hp);
}
// 降順ソート
sort(v.begin(), v.end());
// 必殺技でHPが多い順に倒していく
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, K, hp;
long long ans = 0;
cin >> N >> K;
vector<int> v;
for (int i = 0; i < N; i++) {
cin >> hp;
v.push_back(hp);
}
// 降順ソート
sort(v.begin(), v.end());
// 必殺技でHPが多い順に倒していく
... | replace | 22 | 23 | 22 | 23 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int long long N, K, t = 0, i, j = 0, a;
int long long ans = 0;
cin >> N >> K;
std::vector<int long long> H(N);
for (i = 0; i < N; i++) {
cin >> a;
H[i] = a;
ans += a;
}
sort(H.begin(), H.end(), greater<>());
f... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int long long N, K, t = 0, i, j = 0, a;
int long long ans = 0;
cin >> N >> K;
if (N <= K) {
ans = 0;
} else {
std::vector<int long long> H(N);
for (i = 0; i < N; i++) {
cin >> a;
H[i] = a;
ans += ... | replace | 10 | 19 | 10 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a.rbegin(), a.rend());
for (int i = 0; i < k; i++) {
sum -= a[i];
}
cout << sum;
}
int main() {
io... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return;
}
sort(a.rbegin(), a.rend());
for (int i = 0; i < k; i++) {
sum -... | insert | 11 | 11 | 11 | 15 | 0 | |
p02785 | C++ | Runtime Error | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, k) for (int i = 0; i < k; i++)
ll n, m[22][... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, k) for (int i = 0; i < k; i++)
ll n, m[22][... | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | #include <bits/stdc++.h>
#define ll long long
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int h;
int n;
int k;
int a[20009];
int main() {
while (cin >> n >> k) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k > 0) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int h;
int n;
int k;
long long a[200009];
int main() {
while (cin >> n >> k) {
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long sum = 0;
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (k > 0) {... | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int h[N];
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<int>());
ll ans = 0;
for (int i = k; i < n; ++i)
ans += h[i];
cout << ans;
return 0;
}
/*
*... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int h[N];
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<int>());
ll ans = 0;
for (int i = k; i < n; ++i)
ans += h[i];
cout << ans;
return 0;
}
/*
*... | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << ... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define debug(x) cout << #x << ":" << x << ' ';
#define debugg(x) cout << #x << ":" << ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
int main() {
int n, k;
ll ans = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
ans += a[i];
}
sort(a + 1, a + 1 + n);
for (int i = n; i > n - k && i >= 0; i--) {
ans -= a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200010];
int main() {
int n, k;
ll ans = 0;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
ans += a[i];
}
sort(a + 1, a + 1 + n);
for (int i = n; i > n - k && i >= 0; i--) {
ans -= a[i];
}
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max = 0x3f3f3f3f;
int a[100005];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
if (k >= n)
printf("0\n");
else {
l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max = 0x3f3f3f3f;
int a[200005];
int main() {
int n, k;
while (~scanf("%d%d", &n, &k)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
if (k >= n)
printf("0\n");
else {
l... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long a, b, c, i, j;
vector<long> v;
cin >> a >> b;
for (i = 0; i < a; i++) {
cin >> c;
v.push_back(c);
}
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long a, b, c, i, j;
vector<long> v;
cin >> a >> b;
for (i = 0; i < a; i++) {
cin >> c;
v.push_back(c);
}
... | insert | 21 | 21 | 21 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int sum;
sum = accumulate(h.begin(), h.begin() + n - k, 0);
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
long long sum;
if (n > k) {
sum = accumulate(h.begin(), h.begin() + n - k, 0LL);
} else
sum = 0;
cout << sum << end... | replace | 10 | 12 | 10 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | insert | 47 | 47 | 47 | 49 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cer... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cer... | replace | 89 | 94 | 89 | 96 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream fin("hps.in");
ofstream fout("hps.out");
#define f first
#define s second
#define pb push_back
int n, k, h[100002];
ll ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
sort(h + 1, h + n + 1);
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream fin("hps.in");
ofstream fout("hps.out");
#define f first
#define s second
#define pb push_back
int n, k, h[200002];
ll ans;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
sort(h + 1, h + n + 1);
f... | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#inc... | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#inc... | replace | 66 | 67 | 66 | 67 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll n, k;
cin >> n >> k;
if (n <= k) {
cout << 0 << e... | insert | 12 | 12 | 12 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// モンスターの数, 必殺技の回数
int N, K;
cin >> N >> K;
// N体のモンスターの体力
vector<long long> HP(N);
for (long long &x : HP)
cin >> x;
sort(HP.begin(), HP.end(), greater<long long>());
// HPが高い敵をK体倒す
for (auto itr = HP.begin(); itr < HP.begin() + K; ++i... | #include <bits/stdc++.h>
using namespace std;
int main() {
// モンスターの数, 必殺技の回数
int N, K;
cin >> N >> K;
// N体のモンスターの体力
vector<long long> HP(N);
for (long long &x : HP)
cin >> x;
sort(HP.begin(), HP.end(), greater<long long>());
// HPが高い敵をK体倒す
for (auto itr = HP.begin(); (itr < (HP.begin() + min(... | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) { h.pop_back(); }
ll ans = 0;
rep(i, h.size()) ans += h[i];
cout << an... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
k = min(n, k);
rep(i, k) { h.pop_back(); }
ll ans = 0;
rep(i, h.size()) ans += h... | insert | 11 | 11 | 11 | 12 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> h(n);
long long tmp = 0;
long long lol = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
lol = lol + h.at(i);
}
if (k == 0) {
cout << lol << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> h(n);
long long tmp = 0;
long long lol = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> h.at(i);
lol = lol + h.at(i);
}
if (k == 0) {
cout << lol << endl;
return 0;
}... | replace | 33 | 42 | 33 | 34 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
sum += h.at(i);
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) {
cin >> h.at(i);
sum += h.at(i);
}
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long count = 0;
sort(A.begin(), A.end(), greater<>());
for (int i = 0; i < K; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long count = 0;
sort(A.begin(), A.end());
for (int i = 0; i < N - K; i++) {
count += A[i];
}
cout << count << endl;
return 0;
}... | replace | 11 | 16 | 11 | 13 | 0 | |
p02785 | C++ | Runtime Error | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) // 小さい方からソート
#define REV(V) reverse(ALL(V)) // リバース
#define RSORT(V... | replace | 85 | 86 | 85 | 90 | 0 | |
p02785 | C++ | Runtime Error | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k, x;
vector<ll> v;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
sort(v.begin()... | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k, x;
vector<ll> v;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (k >= n) {
... | insert | 18 | 18 | 18 | 22 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <int id> struct CompTupleBy {
template <class T> bool operator()(const T &a... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define all(x) (x).begin(), (x).end()
#define INF 10000000
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <int id> struct CompTupleBy {
template <class T> bool operator()(const T &a... | insert | 24 | 24 | 24 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, n, m, M, K, a;
vector<ll> v, w;
int main() {... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N, n, m, M, K, a;
vector<ll> v, w;
int main() {... | replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < k; ++i) {
h[i] = 0;
}
ll sum = 0;
for (ll i = 0... | #include <bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h.rbegin(), h.rend());
for (ll i = 0; i < min(n, k); ++i) {
h[i] = 0;
}
ll sum = 0;
for (... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];... | replace | 20 | 21 | 20 | 21 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005], k, s = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
cout << s;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long n, a[200005], k, s = 0;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - k; i++)
s += a[i];
cout << s;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> HP(n);
for (int i = 0; i < n; i++) {
cin >> HP.at(i);
}
sort(HP.begin(), HP.end());
for (int i = 0; i < k; i++) {
HP.pop_back();
}
long long sum = 0;
for (int i = 0; i < HP.size(); i++) {
sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n <= k) {
cout << "0" << endl;
return 0;
}
vector<int> HP(n);
for (int i = 0; i < n; i++) {
cin >> HP.at(i);
}
sort(HP.begin(), HP.end());
for (int i = 0; i < k; i++) {
HP.pop_back();
}
long lo... | insert | 6 | 6 | 6 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, h[100100], i, ans = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, h[200100], i, ans = 0;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (i = 0; i < n - k; i++) {
ans += h[i];
}
cout << ans << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST ... | replace | 126 | 127 | 126 | 127 | 0 |
Time Elasped : 0.028346
|
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
// vector<unsigned int> h(n);
unsigned int h[20000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
reverse(h, h + n);
for (int i = 0; i < k; i++) {
h[i] = 0;
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
// vector<unsigned int> h(n);
unsigned int h[200005];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
reverse(h, h + n);
for (int i = 0; i < k; i++) {
h[i] = 0;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02785 | C++ | Runtime Error | /*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define End return 0
int main() {
ll n, a;
cin >> n >> a;
ll aa[a];
ll s = 0;
for (ll i = 0; i < n; i++) {
cin >> aa[i];
s += aa[i];
}
if (n <= a)
co... | /*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define End return 0
int main() {
ll n, a;
cin >> n >> a;
ll aa[n];
ll s = 0;
for (ll i = 0; i < n; i++) {
cin >> aa[i];
s += aa[i];
}
if (n <= a)
co... | replace | 14 | 15 | 14 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int aa[100005];
long long int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &aa[i]);
}
sort(aa + 1, aa + 1 + n);
if (m >= n)
cout << "0";
else {
for (int i = 1; i <= n - m; i++) {
ans = ans + a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int aa[200005];
long long int ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &aa[i]);
}
sort(aa + 1, aa + 1 + n);
if (m >= n)
cout << "0";
else {
for (int i = 1; i <= n - m; i++) {
ans = ans + a... | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k, ar[100005], i, sum = 0;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n, greater<int>());
for (i = k; i < n; i++)
sum += ar[i];
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k, ar[200005], i, sum = 0;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n, greater<int>());
for (i = k; i < n; i++)
sum += ar[i];
cout << sum << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define debug printf("Now is Line : %d\n", __LINE__)
#define file(a) \
freopen(#a ".in", "r", stdin); \
freopen(#a ".out", ... | #include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define debug printf("Now is Line : %d\n", __LINE__)
#define file(a) \
freopen(#a ".in", "r", stdin); \
freopen(#a ".out", ... | replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb emplace_back
#define re return
#define fi first
#define se second
#define a... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb emplace_back
#define re return
#define fi first
#define se second
#define a... | replace | 40 | 41 | 40 | 41 | 0 | |
p02785 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main() {
int n, k;
cin >> n >> k;
vi h... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main() {
int n, k;
cin >> n >> k;
vi h... | replace | 24 | 25 | 24 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100000;
int main() {
int N, K;
int H[MAX];
long long ans = 0;
cin >> N >> K... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 200000;
int main() {
int N, K;
int H[MAX];
long long ans = 0;
cin >> N >> K... | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MAXX 5... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MAXX 5... | replace | 27 | 28 | 27 | 28 | 0 | |
p02785 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
#define fill(a) memset(a, 0, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int(i) = 0; (i) < (int)... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
#define fill(a) memset(a, 0, sizeof(a))
#define all(v) (v).begin(), (v).end()
#define sp(k) cout << setprecision(k) << fixed;
#define rep(i, a) for (int(i) = 0; (i) < (int)... | replace | 39 | 46 | 39 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, K, H[100000] = {};
long long ans = 0;
cin >> N >> K;
if (K >= N) {
cout << 0 << endl;... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int N, K, H[1000000];
long long ans = 0;
cin >> N >> K;
if (K >= N) {
cout << 0 << endl;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k, i;
cin >> n >> k;
lli a[n];
lli sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return 0;
} else {
for (i = n - 1; i >= 0; i++) {
if (k == 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k, i;
cin >> n >> k;
lli a[n];
lli sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k >= n) {
cout << 0;
return 0;
} else {
sort(a, a + n);
for (i = n - 1; i >= 0; i--... | replace | 18 | 19 | 18 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, co... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, co... | replace | 33 | 34 | 33 | 34 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | replace | 25 | 26 | 25 | 26 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for (ll i = 0; i < n; i++) {
ll H;
cin >> H;
h.p... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for (ll i = 0; i < n; i++) {
ll H;
cin >> H;
h.p... | replace | 23 | 25 | 23 | 30 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
// double c(double x)
// {
// double X = x;
// X = int(X) %... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
// double c(double x)
// {
// double X = x;
// X = int(X) %... | replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// 体力の高いモンスターの順にソート
// k番目の要素から体力を足し算して出力
int N, K;
cin >> N >> K;
int h[10 ^ 6 + 10];
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h, h + N, greater<int>());
long sum = 0;
for (int i = K; i < N; ++i)
sum += h[i];
cout << sum << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 体力の高いモンスターの順にソート
// k番目の要素から体力を足し算して出力
int N, K;
cin >> N >> K;
int h[200010];
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h, h + N, greater<int>());
long sum = 0;
for (int i = K; i < N; ++i)
sum += h[i];
cout << sum << endl;
}... | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll powk(ll a, ll n) {
ll r = 1;
for (ll i = 0; i < n; i++) {
r *= a;
}
return r;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll powk(ll a, ll n) {
ll r = 1;
for (ll i = 0; i < n; i++) {
r *= a;
}
return r;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (l... | replace | 23 | 24 | 23 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.end(), greater<>());
cout << accumulate(H.begin() + K, H.end(),... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
vector<LL> H(N);
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.end(), greater<>());
LL ans = 0;
if (H.size() > K)
ans =... | replace | 19 | 20 | 19 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using u32 = uint32_t;
using u64 = uint64_t;
using i32 = int32_t;
using i64 = int64_t;
int main() {
std::ios_base::sync_with_stdio(0);
i64 n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (i64 i = 0; i < n; ++i) {
std::cin >> h[i];
}
std::sort(h.begin(), h.end(), std... | #include <bits/stdc++.h>
using u32 = uint32_t;
using u64 = uint64_t;
using i32 = int32_t;
using i64 = int64_t;
int main() {
std::ios_base::sync_with_stdio(0);
i64 n, k;
std::cin >> n >> k;
std::vector<i64> h(n);
for (i64 i = 0; i < n; ++i) {
std::cin >> h[i];
}
std::sort(h.begin(), h.end(), std... | replace | 22 | 23 | 22 | 23 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end()... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end()... | insert | 13 | 13 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) { h.pop_back(); }
ll sum = 0;
rep(i, h.size()) sum += h[i];
cout << su... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
k = min(n, k);
rep(i, k) { h.pop_back(); }
ll sum = 0;
rep(i, h.size()) sum += h... | insert | 11 | 11 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | // list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long> H(n);
rep(i, 0, n) { cin >> H[i]; }
rep(i, 0, n) {}
sort(H.begin(), H.end());
rep(i, 0, k... | // list index out of rangeエラー表示用
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long> H(n);
rep(i, 0, n) { cin >> H[i]; }
rep(i, 0, n) {}
sort(H.begin(), H.end());
rep(i, 0, k... | replace | 13 | 14 | 13 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Int long long
#define pb push_back
using namespace std;
Int N, M, K;
Int X, Y, Z, D;
const int MAXN = 105;
Int B, C;
struct DisJointSet {
vector<int> SZ;
vector<int> ID;
int n;
DisJointSet(int n) {
SZ.resize(n);
ID.resize(n);
this->n = n;
for (int i = 0; i < ... | #include <bits/stdc++.h>
#define Int long long
#define pb push_back
using namespace std;
Int N, M, K;
Int X, Y, Z, D;
const int MAXN = 105;
Int B, C;
struct DisJointSet {
vector<int> SZ;
vector<int> ID;
int n;
DisJointSet(int n) {
SZ.resize(n);
ID.resize(n);
this->n = n;
for (int i = 0; i < ... | replace | 54 | 55 | 54 | 55 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K, H[101010];
ll i, j, k;
int main() {
scanf("%lld%lld", &N, &K);
fornum(i, 0, N) { s... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, K, H[202020];
ll i, j, k;
int main() {
scanf("%lld%lld", &N, &K);
fornum(i, 0, N) { s... | replace | 10 | 11 | 10 | 11 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
rep(i, k) h[i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.rbegin(), h.rend());
if (k > n)
k = n;
rep(i, k) h[i] = 0;
ll ans = 0;
... | insert | 13 | 13 | 13 | 15 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int n, k;
cin >> n >> k;
vec<long> h(n);
for (auto &&e : h) {
cin >> e;
}
sort(h.rbegin(), h.rend());
long ans = 0ll;
auto it = h.begin();
it += k;
while (it != h.end()) {
ans += *it;
... | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main() {
int n, k;
cin >> n >> k;
vec<long> h(n);
for (auto &&e : h) {
cin >> e;
}
sort(h.rbegin(), h.rend());
long ans = 0ll;
auto it = h.begin();
while (it != h.end() and k != 0) {
it++;
k--;... | replace | 15 | 16 | 15 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mem(dp, v) memset(dp, v, sizeof dp);
using namespace std;
const int N = 1e3 + 7, inf = 1e9;
ll ar[N], dp[N][N], n, k, t;
int main() {
ll n, k, pw = 1, tot = 0;
// ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mem(dp, v) memset(dp, v, sizeof dp);
using namespace std;
const int N = 1e6 + 7, inf = 1e9;
ll ar[N], n, k, t;
int main() {
ll n, k, pw = 1, tot = 0;
// ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
... | replace | 6 | 8 | 6 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
long long int all[100006];
long long int attackTimes = 0;
cin >> n >> k;
for (long long int i = 0; i < n; i++)
cin >> all[i];
sort(all, all + n);
// cout<<all[0]<<endl;
long long int t = n - k;
if (k >= ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
long long int all[300006];
long long int attackTimes = 0;
cin >> n >> k;
for (long long int i = 0; i < n; i++)
cin >> all[i];
sort(all, all + n);
// cout<<all[0]<<endl;
long long int t = n - k;
if (k >= ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
#define MOD 998244353
ll gcd(ll a... | replace | 52 | 53 | 52 | 53 | 0 | |
p02785 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, k;... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n, k;... | replace | 18 | 19 | 18 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ld long double
#define pii pair<int, int>
#define sz(a) (int)(a.size())
#define resize(v) v.resize(unique(all(v)) - v.begin());
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ld long double
#define pii pair<int, int>
#define sz(a) (int)(a.size())
#define resize(v) v.resize(unique(all(v)) - v.begin());
#defin... | replace | 41 | 42 | 41 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
vector<int64_t> H(100010);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.begin() + N);
int64_t ans = 0;
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, K;
vector<int64_t> H(200010);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
sort(H.begin(), H.begin() + N);
int64_t ans = 0;
for (int i = 0; i < N - K; i++) {
ans += H[i];
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x)... | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false), \
cout << fixed << setprecision(20);
#define int long long
#define gcd __gcd
#define all(x) (x).begin(), (x)... | replace | 28 | 29 | 28 | 29 | TLE | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define LL long long
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 1e5 + 7;
int a[maxn];
int main() {
int n, k;
wh... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define LL long long
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 2e5 + 7;
int a[maxn];
int main() {
int n, k;
wh... | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n, k;
ll h[20000];
cin >> n;
cin >> k;
rep(i, n) { cin >> h[i]; }
sort(h, h + n, greater<ll>());
ll dmg = 0;
for (int... | #include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[]) {
ll n, k;
ll h[1000000];
cin >> n;
cin >> k;
rep(i, n) { cin >> h[i]; }
sort(h, h + n, greater<ll>());
ll dmg = 0;
for (i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, n, dif, sum = 0, a[1000];
cin >> h >> n;
dif = h - n;
if (dif <= 0)
cout << "0" << endl;
else {
for (long long int i = 0; i < h; i++) {
cin >> a[i];
// sum += a;
}
sort(a, a + h);
for (int i = 0; i < h... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int h, n, dif, sum = 0, a[1000000];
cin >> h >> n;
dif = h - n;
if (dif <= 0)
cout << "0" << endl;
else {
for (long long int i = 0; i < h; i++) {
cin >> a[i];
// sum += a;
}
sort(a, a + h);
for (int i = 0; i ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll w[100000];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
w[i] = a;
}
sort(w, w + n);
for (int i = 0; i < n - k; i+... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll w[300000];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
w[i] = a;
}
sort(w, w + n);
for (int i = 0; i < n - k; i+... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
int main(void) {
long long N, K, H[200005], S, i;
scanf("%lld%lld", &N, &K);
for (i = 0; i < N; i++)
scanf("%lld", &H[i]);
std::sort(H, H + N);
for (i = N - K; i < N; i++)
H[i] = 0;
S = 0;
for (i = 0; i < N; i++)
S += H[i];
printf("%lld", S);
return... | #include <algorithm>
#include <stdio.h>
int main(void) {
long long N, K, H[200005], S, i;
scanf("%lld%lld", &N, &K);
if (K >= N) {
printf("0");
return 0;
}
for (i = 0; i < N; i++)
scanf("%lld", &H[i]);
std::sort(H, H + N);
for (i = N - K; i < N; i++)
H[i] = 0;
S = 0;
for (i = 0; i < N... | insert | 6 | 6 | 6 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int n, k, i, ar[100005], ans;
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
for (i = 0; i < n - k; i++)
ans += ar[i];
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll int n, k, i, ar[200005], ans;
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
for (i = 0; i < n - k; i++)
ans += ar[i];
cout << ans;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long> hn(n);
rep(i, n) { cin >> hn[i]; }
sort(hn.begin(), hn.end());
reverse(hn.begin(), hn.end());
long sum = 0;
rep(i, k) { hn[i] = 0; }
rep(i, n) { sum +=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
if (n <= k) {
cout << 0;
return 0;
}
vector<long> hn(n);
rep(i, n) { cin >> hn[i]; }
sort(hn.begin(), hn.end());
reverse(hn.begin(), hn.end());
long sum = 0... | insert | 7 | 7 | 7 | 11 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
void merge_sort(int array[], int left, int right) {
int i, j, k, mid;
int work[10];
if (left < right) {
mid = (left + right) / 2;
merge_sort(array, left, mid);
merge_sort(array, mid + 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
void merge_sort(int array[], int left, int right) {
int i, j, k, mid;
int work[200010];
if (left < right) {
mid = (left + right) / 2;
merge_sort(array, left, mid);
merge_sort(array, mid... | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int H[20010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
if (N <= K)
cout << 0 << endl;
else {
sort(H, H + N);
long ans = 0;
for (int i = 0; i < (N - K); i++)
ans += H[i];
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int H[200010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
if (N <= K)
cout << 0 << endl;
else {
sort(H, H + N);
long ans = 0;
for (int i = 0; i < (N - K); i++)
ans += H[i];
cout << ans << endl;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
... | #include <bits/stdc++.h>
using namespace std;
// input
#define INIT \
std::ios::sync_with_stdio(false); \
std::cin.tie(0);
#define VAR(type, ...) \
... | replace | 186 | 187 | 186 | 192 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<ll>());
for (int i = 0; i < k; ++i)
h[i] = 0;
c... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
using ll = long long;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h, h + n, greater<ll>());
for (int i = 0; i < min(k, n); ++i)
h[i] =... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
// #include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
... | // inlclude前用define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
// #include<deque>
#include <iomanip>
#include <limits>
#include <map>
#include <set>
#include <tuple>
using namespace std;
... | insert | 40 | 40 | 40 | 42 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | insert | 72 | 72 | 72 | 76 | 0 | |
p02785 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | replace | 26 | 27 | 26 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> data(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> data(... | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int K;
cin >> K;
vector<long long int> H;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long int ans = 0;
for (int i = K; i < N; i++) {
ans = ans + H[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int K;
cin >> K;
vector<long long int> H(N, 0);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long int ans = 0;
for (int i = K; i < N; i++) {
ans = ans + H... | replace | 7 | 8 | 7 | 8 | -11 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> h;
for (int i = 0; i < n; ++i) {
long t;
cin >> t;
h.push_back(t);
}
sort(h.begin(), h.end(), greater<long>());
for (int i = 0; i < k; ++i) {
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> h;
for (int i = 0; i < n; ++i) {
long t;
cin >> t;
h.push_back(t);
}
sort(h.begin(), h.end(), greater<long>());
for (int i = 0; i < min(k, n);... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | replace | 31 | 32 | 31 | 32 | 0 | |
p02785 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 69 | 70 | 69 | 70 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (... | replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lol long long
using namespace std;
lol m[100000];
int main() {
lol a, b, c, ans = 0;
string s;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> m[i];
}
sort(m, m + a, greater<lol>());
for (int i = b; i < a; i++) {
ans += m[i];
}
cout << ans << "\n";
return... | #include <bits/stdc++.h>
#define lol long long
using namespace std;
lol m[200005];
int main() {
lol a, b, c, ans = 0;
string s;
cin >> a >> b;
for (int i = 0; i < a; i++) {
cin >> m[i];
}
sort(m, m + a, greater<lol>());
for (int i = b; i < a; i++) {
ans += m[i];
}
cout << ans << "\n";
return... | replace | 3 | 4 | 3 | 4 | 0 | |
p02785 | 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;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
cout << accumulate(h.begin(), h.begin() + n - k, 0LL) ... | #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;
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
ll sum = 0;
rep(i, n - k) sum += h[i];
cout << sum... | replace | 12 | 13 | 12 | 15 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.